Assignment Problems in Parallel and Distributed ComputingThis book has been written for practitioners, researchers and stu dents in the fields of parallel and distributed computing. Its objective is to provide 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 practitioner, this book serves as a rich source of solution techniques for problems that are routinely encountered in the real world. Algorithms are presented in sufficient detail to permit easy implementa tion; background material and fundamental concepts are covered in full. The researcher will find a clear exposition of graph theoretic tech niques applied to parallel and distributed computing. Research results are covered and many hitherto unpublished spanning the last decade results by the author are included. There are many unsolved problems in this field-it is hoped that this book will stimulate further research. |
Other editions - View all
Assignment Problems in Parallel and Distributed Computing Shahid H. Bokhari No preview available - 2012 |
Assignment Problems in Parallel and Distributed Computing Shahid H Bokhari No preview available - 1987 |
Common terms and phrases
allocation graph apply assigned to processor assignment of modules assignment problem assignment tree binary dissection cessor chain limb Chapter communication costs communication link complete binary tree convex polygonal cost edges cost of executing critical load factors critical load line cutset described directed graph distributed computing distributed processing distributed program dynamic assignment graph edge joining executing module execution costs find the optimal floating point unit forkset Fortran graph of Figure graph theory host hypercube interprocessor communication invocation tree layer layered graph load plane load point loading chain machine mapping problem ment minimize minimum weight modular program network flow number of edges number of nodes optimal assignment optimal SB path P₁ P₂ parallel processing partitioning phase pipelined problem graph program graph regions relocation cost s-t cut satellite Section serial program series-parallel graph shortest path shown in Figure single-host solution subgraph task techniques terminal nodes tion undirected weighted graph