Exact and Approximate Algorithms for Assignment Problems in Distributed Systems PDF Download
Are you looking for read ebook online? Search for your book and save it on your Kindle device, PC, phones or tablets. Download Exact and Approximate Algorithms for Assignment Problems in Distributed Systems PDF full book. Access full book title Exact and Approximate Algorithms for Assignment Problems in Distributed Systems by David Fernandez-Baca. Download full books in PDF and EPUB format.
Author: David Fernandez-Baca Publisher: 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."
Author: David Fernandez-Baca Publisher: 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."
Author: Iowa State University. Dept. of Computer Science Publisher: 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."
Author: Lap Chi Lau Publisher: Cambridge University Press ISBN: 1139499394 Category : Computers Languages : en Pages : 255
Book Description
With the advent of approximation algorithms for NP-hard combinatorial optimization problems, several techniques from exact optimization such as the primal-dual method have proven their staying power and versatility. This book describes a simple and powerful method that is iterative in essence and similarly useful in a variety of settings for exact and approximate optimization. The authors highlight the commonality and uses of this method to prove a variety of classical polyhedral results on matchings, trees, matroids and flows. The presentation style is elementary enough to be accessible to anyone with exposure to basic linear algebra and graph theory, making the book suitable for introductory courses in combinatorial optimization at the upper undergraduate and beginning graduate levels. Discussions of advanced applications illustrate their potential for future application in research in approximation algorithms.
Author: E. Cela Publisher: Springer Science & Business Media ISBN: 1475727879 Category : Mathematics Languages : en Pages : 296
Book Description
The quadratic assignment problem (QAP) was introduced in 1957 by Koopmans and Beckmann to model a plant location problem. Since then the QAP has been object of numerous investigations by mathematicians, computers scientists, ope- tions researchers and practitioners. Nowadays the QAP is widely considered as a classical combinatorial optimization problem which is (still) attractive from many points of view. In our opinion there are at last three main reasons which make the QAP a popular problem in combinatorial optimization. First, the number of re- life problems which are mathematically modeled by QAPs has been continuously increasing and the variety of the fields they belong to is astonishing. To recall just a restricted number among the applications of the QAP let us mention placement problems, scheduling, manufacturing, VLSI design, statistical data analysis, and parallel and distributed computing. Secondly, a number of other well known c- binatorial optimization problems can be formulated as QAPs. Typical examples are the traveling salesman problem and a large number of optimization problems in graphs such as the maximum clique problem, the graph partitioning problem and the minimum feedback arc set problem. Finally, from a computational point of view the QAP is a very difficult problem. The QAP is not only NP-hard and - hard to approximate, but it is also practically intractable: it is generally considered as impossible to solve (to optimality) QAP instances of size larger than 20 within reasonable time limits.
Author: Wan Fokkink Publisher: MIT Press ISBN: 0262318954 Category : Computers Languages : en Pages : 242
Book Description
A comprehensive guide to distributed algorithms that emphasizes examples and exercises rather than mathematical argumentation. This book offers students and researchers a guide to distributed algorithms that emphasizes examples and exercises rather than the intricacies of mathematical models. It avoids mathematical argumentation, often a stumbling block for students, teaching algorithmic thought rather than proofs and logic. This approach allows the student to learn a large number of algorithms within a relatively short span of time. Algorithms are explained through brief, informal descriptions, illuminating examples, and practical exercises. The examples and exercises allow readers to understand algorithms intuitively and from different perspectives. Proof sketches, arguing the correctness of an algorithm or explaining the idea behind fundamental results, are also included. An appendix offers pseudocode descriptions of many algorithms. Distributed algorithms are performed by a collection of computers that send messages to each other or by multiple software threads that use the same shared memory. The algorithms presented in the book are for the most part “classics,” selected because they shed light on the algorithmic design of distributed systems or on key issues in distributed computing and concurrent programming. Distributed Algorithms can be used in courses for upper-level undergraduates or graduate students in computer science, or as a reference for researchers in the field.
Author: David Fernandez-Baca
Author: David Fernandez-Baca
Author: Iowa State University. Dept. of Computer Science
Author: Giorgio Ausiello
Author: Chadi El Kari
Author: Lap Chi Lau
Author: Gerard Tel
Author: Institute for Computer Applications in Science and Engineering
Author: E. Cela
Author: Hamid Reza Bahadori
Author: Wan Fokkink