Multiprocessor Scheduling with the Aid of Network Flow Algorithms

Authors:
H. S. Stone
Affiliations:
Department of Electrical and Computer Engineering, University of Massachusetts
Venue:
IEEE Transactions on Software Engineering
Year:
1977

Citing 0
Cited 69

Distributed control of computer systems

IEEE Transactions on Computers - The MIT Press scientific computation series
Assignment of job modules onto array processors

IEEE Transactions on Computers
Processor Allocation for Horizontal and Vertical Parallelism and Related Speedup Bounds

IEEE Transactions on Computers
A Mapping Strategy for Parallel Processing

IEEE Transactions on Computers
Nearest-neighbor mapping of finite element graphs onto processor meshes

IEEE Transactions on Computers
Guided self-scheduling: A practical scheduling scheme for parallel supercomputers

IEEE Transactions on Computers
Partitioning programs for parallel execution

ICS '88 Proceedings of the 2nd international conference on Supercomputing
Support for implementing scheduling algorithms using MESSIAHS

Scientific Programming - Special issue on operating system support for massively parallel computer architectures
Allocation of Periodic Task Modules with Precedence and Deadline Constraints in Distributed Real-Time Systems

IEEE Transactions on Computers
Effects of communication characteristics on task mapping quality on a 2-D mesh with wormhole routing

SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 2
Distributed Multimedia Application Configuration Management

IEEE Transactions on Parallel and Distributed Systems
A Parallel Spatial Join Processing for Distributed Spatial Databases

FQAS '02 Proceedings of the 5th International Conference on Flexible Query Answering Systems
Simulation and Scheduling of Real-Time Computer Vision Algorithms

ICVS '99 Proceedings of the First International Conference on Computer Vision Systems
Dynamic Task Scheduling with Precedence Constraints and Communication Delays

PaCT '999 Proceedings of the 5th International Conference on Parallel Computing Technologies
Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts

ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Executing Divisible Jobs on a Network with a Fixed Number of Processors

COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
Multicriteria Evolutionary Algorithm with Tabu Search for Task Assignment

EMO '01 Proceedings of the First International Conference on Evolutionary Multi-Criterion Optimization
Optimal task assignment in heterogeneous computing systems

HCW '97 Proceedings of the 6th Heterogeneous Computing Workshop (HCW '97)
Multiple Cost Optimization for Task Assignment in Heterogeneous Computing Systems Using Learning Automata

HCW '99 Proceedings of the Eighth Heterogeneous Computing Workshop
Branch-and-bound task allocation with task clustering-based pruning

Journal of Parallel and Distributed Computing
Toward an analytical solution to task allocation, processor assignment, and performance evaluation of network processors

Journal of Parallel and Distributed Computing
Task assignment in heterogeneous computing systems

Journal of Parallel and Distributed Computing
Adaptive load distribution algorithms for heterogeneous distributed systems with multiple task classes

Journal of Parallel and Distributed Computing
Some Compartmentalized Secure Task Assignment Models for Distributed Systems

IEEE Transactions on Parallel and Distributed Systems
Adaptive decomposition and remapping algorithms for object-space-parallel direct volume rendering of unstructured grids

Journal of Parallel and Distributed Computing
A Task Allocation Model for Distributed Computing Systems

IEEE Transactions on Computers
The Isomorphism of Simple File Allocation

IEEE Transactions on Computers
Distribution of Programs for a System with Dynamic Architecture

IEEE Transactions on Computers
Solving a real-time allocation problem with constraint programming

Journal of Systems and Software
A resource aware software partitioning algorithm based on mobility constraints in pervasive grid environments

Future Generation Computer Systems
Cooperative ad hoc computing: towards enabling cooperative processing in wireless environments

International Journal of Parallel, Emergent and Distributed Systems
Efficient service provisioning through dynamic service task assignment in a multi-domain distributed computing environment

International Journal of Internet Protocol Technology
Automated application component placement in data centers using mathematical programming

International Journal of Network Management
The assignment of computational tasks among processors in a distributed system

AFIPS '81 Proceedings of the May 4-7, 1981, national computer conference
Predictive Runtime Code Scheduling for Heterogeneous Architectures

HiPEAC '09 Proceedings of the 4th International Conference on High Performance Embedded Architectures and Compilers
Progressive spill code placement

CASES '09 Proceedings of the 2009 international conference on Compilers, architecture, and synthesis for embedded systems
Quincy: fair scheduling for distributed computing clusters

Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles
The task allocation problem with constant communication

Discrete Applied Mathematics
On a bidirected relaxation for the MULTIWAY CUT problem

Discrete Applied Mathematics
A polynomial algorithm for partitioning problems

ACM Transactions on Embedded Computing Systems (TECS)
TOPPER: an integrated environment for task allocation and execution of MPI applications onto parallel architectures

PCI'01 Proceedings of the 8th Panhellenic conference on Informatics
Smart distribution of bio-signal processing tasks in m-health

OTM'07 Proceedings of the 2007 OTM confederated international conference on On the move to meaningful internet systems - Volume Part I
Rapidly solving an online sequence of maximum flow problems with extensions to computing robust minimum cuts

CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Reliability-aware scheduling strategy for heterogeneous distributed computing systems

Journal of Parallel and Distributed Computing
A novel global harmony search algorithm for task assignment problem

Journal of Systems and Software
A marketplace for cloud resources

EMSOFT '10 Proceedings of the tenth ACM international conference on Embedded software
An efficient algorithm for the physical mapping of clustered task graphs onto multiprocessor architectures

EURO-PDP'00 Proceedings of the 8th Euromicro conference on Parallel and distributed processing
Topology-aware task mapping for reducing communication contention on large parallel machines

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Task assignment in heterogeneous computing systems using an effective iterated greedy algorithm

Journal of Systems and Software
Brief paper: An improved differential evolution algorithm for the task assignment problem

Engineering Applications of Artificial Intelligence
An optimization approach to the synthesis of multichip architectures

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
A generic software partitioning algorithm for pervasive computing

WASA'06 Proceedings of the First international conference on Wireless Algorithms, Systems, and Applications
Fast profile-based partial redundancy elimination

JMLC'06 Proceedings of the 7th joint conference on Modular Programming Languages
Approximating a class of classification problems

Efficient Approximation and Online Algorithms
Static scheduling in clouds

HotCloud'11 Proceedings of the 3rd USENIX conference on Hot topics in cloud computing
DynAGreen: hierarchical dynamic energy efficient task assignment for wireless healthcare systems

Proceedings of the Fifth International Conference on Body Area Networks
Non-preemptive scheduling to maximize the minimum global inter-completion time

Automatica (Journal of IFAC)
Research: Effect of fault tolerance and communication delay on response time in a multiprocessor system with a bus topology

Computer Communications
Dissemination of state information in distributed autonomous systems

Computer Communications
A study of the quadratic semi-assignment polytope

Discrete Optimization
An improved partial solution to the task assignment and multiway cut problems

Operations Research Letters
A Lagrangian relaxation algorithm for sparse quadratic assignment problems

Operations Research Letters
Using xQx to model and solve the uncapacitated task allocation problem

Operations Research Letters
An algorithm for the multiprocessor assignment problem

Operations Research Letters
Migrating operator placement for compositional stream graphs

Proceedings of the 15th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
An improved parameterized algorithm for the minimum node multiway cut problem

WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
An effective iterated greedy algorithm for reliability-oriented task allocation in distributed computing systems

Journal of Parallel and Distributed Computing
Deriving Feasible Deployment Alternatives for Parallel and Distributed Simulation Systems

ACM Transactions on Modeling and Computer Simulation (TOMACS)
On minimizing the resource consumption of cloud applications using process migrations

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.03

Visualization

Abstract

In a distributed computing system a modular program must have its modules assigned among the processors so as to avoid excessive interprocessor communication while taking advantage of specific efficiencies of some processors in executing some program modules. In this paper we show that this program module assignment problem can be solved efficiently by making use of the well-known Ford-Fulkerson algorithm for finding maximum flows in commodity networks as modified by Edmonds and Karp, Dinic, and Karzanov. A solution to the two-processor problem is given, and extensions to three and n-processors are considered with partial results given without a complete efficient solution.