- DOI: 10.1007/978-1-4613-2003-6
- Corpus ID: 58057338
Assignment Problems in Parallel and Distributed Computing
- Published 30 September 1987
- Computer Science, Mathematics
227 Citations
Improved algorithms for partitioning problems in parallel, pipelined, and distributed computing, algorithms and a software tool for scheduling parallel computation, the assignment problem in distributed computing, task assignment and transaction clustering heuristics for distributed systems, optimal task assignment in linear array networks, optimal task assignment in homogeneous networks, two-stage m-way graph partitioning, a task mapping method for a hypercube by combining subcubes, allocating modules to processors in a distributed system with limited memory, allocating tree structured programs in a distributed system with uniform communication costs, related papers.
Showing 1 through 3 of 0 Related Papers
Browse Books
- Kluwer Academic Publishers
- 101 Philip Drive Assinippi Park Norwell, MA
- United States
Save to Binder
No abstract available.
- Lee D (2006). Some Compartmentalized Secure Task Assignment Models for Distributed Systems, IEEE Transactions on Parallel and Distributed Systems , 17 :12 , (1414-1424), Online publication date: 1-Dec-2006 .
- Publication Years 1978 - 2014
- Publication counts 28
- Citation count 188
- Available for Download 4
- Downloads (cumulative) 877
- Downloads (12 months) 95
- Downloads (6 weeks) 31
- Average Downloads per Article 219
- Average Citation per Article 7
Recommendations
Analytical modelling in parallel and distributed computing, distributed parallel computing using navigational programming.
Message Passing (MP) and Distributed Shared Memory (DSM) are the two most common approaches to distributed parallel computing. MP is difficult to use, whereas DSM is not scalable. Performance scalability and ease of programming can be achieved at the ...
Software support for distributed and parallel computing
Export citations.
- Please download or close your previous search result export first before starting a new bulk export. Preview is not available. By clicking download, a status dialog will open to start the export process. The process may take a few minutes but once it finishes a file will be downloadable from your browser. You may continue to browse the DL while the export process is in progress. Download
- Download citation
- Copy citation
We are preparing your search results for download ...
We will inform you here when the file is ready.
Your file of search results citations is now ready.
Your search export query has expired. Please try again.
- Sign in
- My Account
- Basket
Items related to Assignment Problems in Parallel and Distributed Computing...
Assignment problems in parallel and distributed computing (the springer international series in engineering and computer science, 32) - hardcover, bokhari, shahid h..
- About this edition
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.
"synopsis" may belong to another edition of this title.
- Publisher Springer
- Publication date 1987
- ISBN 10 0898382408
- ISBN 13 9780898382402
- Binding Hardcover
- Number of pages 180
Convert currency
Shipping: US$ 4.50 Within U.S.A.
Add to basket
Shipping: US$ 3.99 Within U.S.A.
Other Popular Editions of the Same Title
Featured edition.
ISBN 10: 146129195X ISBN 13: 9781461291954 Publisher: Springer, 2012 Softcover
Top Search Results from the AbeBooks Marketplace
Assignment problems in parallel and distributed computing (the springer international series in engineering and computer science, 32).
Seller: Zubal-Books, Since 1961 , Cleveland, OH, U.S.A.
(5-star seller) Seller rating 5 out of 5 stars
Condition: Very Good. *Price HAS BEEN REDUCED by 10% until Monday, Oct. 21 (sale item)* 154 pp., hardcover, minor library markings, else text clean and binding tight. - If you are reading this, this item is actually (physically) in our stock and ready for shipment once ordered. We are not bookjackers. Buyer is responsible for any additional duties, taxes, or fees required by recipient's country. Seller Inventory # ZB1307917
Contact seller
Quantity: 1 available
Assignment Problems in Parallel and Distributed Computing
Seller: Ammareal , Morangis, France
Hardcover. Condition: Bon. Ancien livre de biblioth�que. Traces d'usure sur la couverture. Edition 1987. Editeur diff�rent. Ammareal reverse jusqu'� 15% du prix net de cet article � des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Good. Former library book. Signs of wear on the cover. Edition 1987. Different publisher. Ammareal gives back up to 15% of this item's net price to charity organizations. Seller Inventory # E-577-924
Seller: Lucky's Textbooks , Dallas, TX, U.S.A.
Condition: New. Seller Inventory # ABLIING23Mar2317530032036
Quantity: Over 20 available
Seller: Ria Christie Collections , Uxbridge, United Kingdom
Condition: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book. Seller Inventory # ria9780898382402_lsuk
Seller: Books Puddle , New York, NY, U.S.A.
Condition: New. pp. 184. Seller Inventory # 263060335
Seller: California Books , Miami, FL, U.S.A.
Condition: New. Seller Inventory # I-9780898382402
Seller: BuchWeltWeit Ludwig Meier e.K. , Bergisch Gladbach, Germany
Buch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 184 pp. Englisch. Seller Inventory # 9780898382402
Quantity: 2 available
Seller: Biblios , Frankfurt am main, HESSE, Germany
Condition: New. pp. 184. Seller Inventory # 183060325
Seller: Majestic Books , Hounslow, United Kingdom
Condition: New. pp. 184 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam. Seller Inventory # 5836208
Seller: moluna , Greven, Germany
Gebunden. Condition: New. Seller Inventory # 5982398
There are 6 more copies of this book
Network Flow Techniques
Cite this chapter.
- Shahid H. Bokhari 3 , 4
Part of the book series: The Kluwer International Series in Engineering and Computer Science ((SECS,volume 32))
86 Accesses
The application of network flow algorithms to assignment problems in distributed computer systems was pioneered by Harold Stone (77a). He showed how an assignment problem can be transformed into a network flow problem such that there is a one-to-one correspondence between assignments and cutsets. For the case of two processor problems, the optimal assignment—which corresponds to the minimum weight cutset—can be found very efficiently using any one of several available network flow algorithms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Subscribe and save.
- Get 10 units per month
- Download Article/Chapter or eBook
- 1 Unit = 1 Article or 1 Chapter
- Cancel anytime
- Available as PDF
- Read on any device
- Instant download
- Own it forever
- Compact, lightweight edition
- Dispatched in 3 to 5 business days
- Free shipping worldwide - see info
- Durable hardcover edition
Tax calculation will be finalised at checkout
Purchases are for personal use only
Institutional subscriptions
Unable to display preview. Download preview PDF.
Author information
Authors and affiliations.
Department of Electrical Engineering, University of Engineering & Technology, Lahore, Pakistan
Shahid H. Bokhari
Institute for Computer Applications in Science & Engineering, NASA Langley Research Center, Hampton, Virginia, USA
You can also search for this author in PubMed Google Scholar
Rights and permissions
Reprints and permissions
Copyright information
© 1997 Kluwer Academic Publishers
About this chapter
Bokhari, S.H. (1997). Network Flow Techniques. In: Assignment Problems in Parallel and Distributed Computing. The Kluwer International Series in Engineering and Computer Science, vol 32. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-2003-6_3
Download citation
DOI : https://doi.org/10.1007/978-1-4613-2003-6_3
Publisher Name : Springer, Boston, MA
Print ISBN : 978-1-4612-9195-4
Online ISBN : 978-1-4613-2003-6
eBook Packages : Springer Book Archive
Share this chapter
Anyone you share the following link with will be able to read this content:
Sorry, a shareable link is not currently available for this article.
Provided by the Springer Nature SharedIt content-sharing initiative
- Publish with us
Policies and ethics
- Find a journal
- Track your research
IMAGES
VIDEO
COMMENTS
Message Passing (MP) and Distributed Shared Memory (DSM) are the two most common approaches to distributed parallel computing. MP is difficult to use, whereas DSM is not scalable. Performance scalability and ease of programming can be achieved at the ...
Assignment Problems in Parallel and Distributed Computing. S. Bokhari. Published 30 September 1987. Computer Science, Mathematics. TLDR. The Motivations for Distributed Processing of Serial Programs is a guide to finding the Optimal Assignment across Space and Time and Formulation of the Problem. Expand. View via Publisher. Save to Library.
Assignment Problems in Parallel and Distributed Computing. Shahid H. Bokhari. Springer Science & Business Media, Sep 30, 1987 - Computers - 156 pages. This book has been written for...
Assignment Problems in Parallel and Distributed ComputingAugust 1987. Author: Shahid H. Bokhari. Publisher: Kluwer Academic Publishers. 101 Philip Drive Assinippi Park Norwell, MA. United States. ISBN: 978-0-89838-240-2. Published: 01 August 1987. Pages: 154. Available at Amazon. Save to Binder Export Citation. Bibliometrics. Downloads (cumulative)
Abstract: Task assignment is one of the core steps to effectively exploit the capabilities of distributed or parallel computing systems. The task assignment problem is an NP-complete problem. In this paper, we present a new task assignment algorithm that is based on the principles of particle swarm optimization (PSO).
An efficient assignment of tasks to the processors is imperative for achieving a fast job turnaround time in a parallel or distributed enviornment. The assignment problem is well known to be NP-complete, except in a few special cases. Thus heuristics are used to obtain suboptimal solutions in reasonable amount of time.
A formal multi-level model for assigning parallel tasks to distributed hardware. Insights that allow optimal timing solutions to be found using standard solvers. Experimental results for a suite of real software benchmarks on the Axel cluster. Robust timing improvements over previous parallel approaches (up to 2.021 times faster). Previous.
Assignment Problems in Parallel and Distributed Computing (The Springer International Series in Engineering and Computer Science, 32) by Bokhari, Shahid H. - ISBN 10: 0898382408 - ISBN 13: 9780898382402 - Springer - 1987 - Hardcover
The researcher will find a clear exposition of graph theoretic techniques applied to parallel and distributed computing. Research results are covered and many hitherto unpublished spanning the last decade results by the author are included.
The application of network flow algorithms to assignment problems in distributed computer systems was pioneered by Harold Stone (77a). He showed how an assignment problem can be transformed into a network flow problem such that there is a one-to-one correspondence between assignments and cutsets.