Allocating programs containing branches and loops within a multiple processor system

DOI10.1109/TSE.1986.6313018zbMath0599.68030OpenAlexW2071636055MaRDI QIDQ3735072

Don Towsley

Publication date: 1986

Published in: IEEE Transactions on Software Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tse.1986.6313018

zbMATH Keywords

distributed systemdistributed processingcomputer networksdistributed programshortest path methodsmultiprocessor system scheduling

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Related Items (10)

Nonserial dynamic programming formulations of satisfiability ⋮ A Lagrangian relaxation algorithm for sparse quadratic assignment problems ⋮ The Boolean quadratic programming problem with generalized upper bound constraints ⋮ AN EFFECTIVE APPROACH FOR DISTRIBUTED PROGRAM ALLOCATION ⋮ Lower bounds for the quadratic semi-assignment problem ⋮ Complexity analysis of new task allocation problem using network flow method on multicore clusters ⋮ An O\((nm)\) algorithm for a special case of the multimedian location problem on a tree ⋮ A study of the quadratic semi-assignment polytope ⋮ The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs ⋮ Partitioning multiple-chain-like task across a host-satellite system

This page was built for publication: Allocating programs containing branches and loops within a multiple processor system