![Processor Assignment Problem in Distributed Computing [microform] PDF](https://books.google.com/books/content/images/frontcover/lmhPXwAACAAJ?fife=w150-h200)
Author: Dejian ZhouPublisher: National Library of Canada = Bibliothèque nationale du Canada
ISBN: 9780315928107
Category :
Languages : en
Pages : 554
Book Description
Processor Assignment Problem in Distributed Computing [microform]
![Processor Assignment Problem in Distributed Computing [microform] PDF](https://books.google.com/books/content/images/frontcover/lmhPXwAACAAJ?fife=w80-h100)
Author: Dejian ZhouPublisher: National Library of Canada = Bibliothèque nationale du Canada
ISBN: 9780315928107
Category :
Languages : en
Pages : 554
Book Description
The Assignment Problem in Distributed Computing
Author: Anand MedepalliApproximation Algorithms for Certain Assignment Problems in Distributed Systems
Author: Iowa State University. Dept. of Computer SciencePublisher:
ISBN:
Category : Distributed parameter systems
Languages : en
Pages : 44
Book Description
Abstract: "We consider two variants of the task assignment problem for distributed systems. The first is the problem of finding a minimum cost assignment when one of the processors has a limited memory. The second is the problem of finding an assignment that minimizes the maximum processor load. Both problems are NP-hard, even if the communication graph is a tree. We present exact algorithms and approximation schemes for these problems for the case where the communication graph is a partial k-tree. Faster algorithms are presented for the case of trees with uniform costs. We also show that, if the communication graph is unrestricted, there is no fully polynomial-time approximation scheme for the memory-constrained problem unless P = NP."
Scientific and Technical Aerospace Reports
Author: Exact and Approximate Algorithms for Assignment Problems in Distributed Systems
Author: David Fernandez-BacaPublisher:
ISBN:
Category : Distributed parameter systems
Languages : en
Pages : 22
Book Description
Abstract: "We present exact dynamic programming algorithms for two variants of the task assignment problem on distributed systems: (1) finding a minimum-cost assignment when one of the processors has limited memory and (2) finding an assignment that minimizes the maximum processor load. These procedures lead to approximation schemes for the case where the communication graph is a partial k-tree. In contrast to these results, we show that, for arbitrary graphs, no fully polynomial time approximation schemes exist unless P = NP. Finally, we discuss implementation details for our algorithms and summarize our experimental results."
Monthly Catalog of United States Government Publications
Author: Publisher:
ISBN:
Category : Government publications
Languages : en
Pages : 1450
Book Description
Monthly Catalogue, United States Public Documents
Author: Publisher:
ISBN:
Category : Government publications
Languages : en
Pages : 1484
Book Description
The Assignment of Tasks in a Distributed Processing System
Author: Mary Elizabeth Stoll KizerPublisher:
ISBN:
Category : Electronic data processing
Languages : en
Pages : 192
Book Description
Data Bases and Data Base Systems, Related to NASA's Aerospace Program
Author: United States. National Aeronautics and Space Administration. Scientific and Technical Information BranchPublisher:
ISBN:
Category : Astronautics
Languages : en
Pages : 516
Book Description
Author: