Titlebook: Assignment Problems in Parallel and Distributed Computing; Shahid H. Bokhari Book 1987 Kluwer Academic Publishers 1987 Partition.Processin

FORGO

The Sum-Bottleneck Path Algorithm,ributed program. Recent research has shown that a . can be employed to find the optimal assignment of the modules of a parallel or pipelined program in several types of distributed systems. This approach can also be used to find the optimal . of a set of independent serial distributed programs over

foreign

Mapping for Parallel Processing,a multiple computer system. The objective when making these assignments is to minimize some measure of resource usage. Most often the objective is to minimize the total run time of a program by minimizing the sum of execution and interprocessor communication times. The modules of the distributed pro

擦掉

Formal Languages and Compilation the speed of each processor to processor link into account. The tree algorithm can also be used to schedule precedence graphs in a distributed system in which costs vary with time so as to minimize the total cost of execution.

Meditate

Shortest Path Techniques, the speed of each processor to processor link into account. The tree algorithm can also be used to schedule precedence graphs in a distributed system in which costs vary with time so as to minimize the total cost of execution.

ineffectual

epicardium

Graph-Theoretic Concepts, before applying these concepts in an interesting fashion. The reader comfortable with graph theoretic ideas may skip over this chapter, returning as necessary to refer to specific definitions. It is, however, important for the novice to have some familiarity with these ideas before venturing into subsequent chapters.

echnic

Book 1987ide detailed coverage of the applications of graph theoretic tech- niques to the problems of matching resources and requirements in multi- ple computer systems. There has been considerable research in this area over the last decade and intense work continues even as this is being written. For the pr

Transfusion

Abutment

Basic Notation and Terminology,ne processor at a time) or parallel (several modules concurrently active on several processors). The assignment problem deals with the question of assigning modules to processors so as to minimize the cost of running a program. The cost may be time, money or some other measure of resource usage.

使虛弱