The Assignment Problem in Distributed Computing PDF Download

Author: Anand Medepalli
Publisher:
ISBN:
Category :
Languages : en
Pages : 344

View

Book Description

Author: Shahid H. Bokhari
Publisher: Springer Science & Business Media
ISBN: 1461320038
Category : Computers
Languages : en
Pages : 167

View

Book Description
This 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.

Author: Dejian Zhou
Publisher: National Library of Canada = Bibliothèque nationale du Canada
ISBN: 9780315928107
Category :
Languages : en
Pages : 554

View

Book Description

Author: Iowa State University. Dept. of Computer Science
Publisher:
ISBN:
Category : Distributed parameter systems
Languages : en
Pages : 44

View

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: Virginia Mary Lo
Publisher:
ISBN:
Category : Electronic data processing
Languages : en
Pages : 150

View

Book Description

Author: David Fernandez-Baca
Publisher:
ISBN:
Category : Distributed parameter systems
Languages : en
Pages : 22

View

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: E. Cela
Publisher: Springer Science & Business Media
ISBN: 1475727879
Category : Mathematics
Languages : en
Pages : 296

View

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: Sotiris Nikoletseas
Publisher: Springer
ISBN: 3540691707
Category : Computers
Languages : en
Pages : 567

View

Book Description
The book constitutes the refereed proceedings of the 4th International Conference on Distributed Computing in Sensor Systems, DCOSS 2008, held on Santorini Island, Greece, in June 2008. The 29 revised full papers and 12 revised short papers presented were carefully reviewed and selected from 116 submissions. The papers propose a multitude of novel algorithmic design and analysis techniques, systematic approaches and application development methodologies for distributed sensor networking. The papers cover aspects including energy management, communication, coverage and tracking, time synchronization and scheduling, key establishment and authentication, compression, medium access control, code update, and mobility.

Author: L. Dekker
Publisher: Elsevier
ISBN: 1483290433
Category : Computers
Languages : en
Pages : 996

View

Book Description
The contributions of a diverse selection of international hardware and software specialists are assimilated in this book's exploration of the development of massively parallel processing (MPP). The emphasis is placed on industrial applications and collaboration with users and suppliers from within the industrial community consolidates the scope of the publication. From a practical point of view, massively parallel data processing is a vital step to further innovation in all areas where large amounts of data must be processed in parallel or in a distributed manner, e.g. fluid dynamics, meteorology, seismics, molecular engineering, image processing, parallel data base processing. MPP technology can make the speed of computation higher and substantially reduce the computational costs. However, to achieve these features, the MPP software has to be developed further to create user-friendly programming systems and to become transparent for present-day computer software. Application of novel electro-optic components and devices is continuing and will be a key for much more general and powerful architectures. Vanishing of communication hardware limitations will result in the elimination of programming bottlenecks in parallel data processing. Standardization of the functional characteristics of a programming model of massively parallel computers will become established. Then efficient programming environments can be developed. The result will be a widespread use of massively parallel processing systems in many areas of application.

Author: Sigeru Omatu
Publisher: Springer
ISBN: 3642024815
Category : Computers
Languages : en
Pages : 1353

View

Book Description
This volume (II) contains all publications accepted for the symposiums and workshops held in parallel with the 10th International Work-Conference on Artificial Neural Networks (IWANN 2009), covering a wide spectrum of technological areas such as distributed computing, artificial intelligence, bioinformatics, soft computing and ambient-assisted living: • DCAI 2009 (International Symposium on Distributed Computing and Artificial Intelligence), covering artificial intelligence and its applications in distributed environments, such as the Internet, electronic commerce, mobile communi- tions, wireless devices, distributed computing, and so on. This event accepted a total of 96 submissions selected from a submission pool of 157 papers, from 12 different countries. • IWAAL 2009 (International Workshop of Ambient-Assisted Living), covering solutions aimed at increasing the quality of life, safety and health problems of elderly and disabled people by means of technology. This event accepted a - tal of 42 submissions selected from a submission pool of 78 papers, from 9 d- ferent countries. • IWPACBB 2009 (Third International Workshop on Practical Applications of Computational Biology and Bioinformatics), covering computational biology and bioinformatics as a possibility for knowledge discovery, modelling and - timization tasks, aiming at the development of computational models so that the response of biological complex systems to any perturbation can be p- dicted. This event accepted a total of 39 submissions selected from a subm- sion pool of 75 papers, from 6 different countries.