Assignment Problems in Parallel and Distributed Computing (Paperback, Softcover reprint of the original 1st ed. 1987)

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."

General

Imprint:	Springer-Verlag New York
Country of origin:	United States
Series:	The Springer International Series in Engineering and Computer Science, 32
Release date:	February 2012
First published:	1987
Authors:	Shahid H. Bokhari
Dimensions:	235 x 155 x 10mm (L x W x T)
Format:	Paperback
Pages:	156
Edition:	Softcover reprint of the original 1st ed. 1987
ISBN-13:	978-1-4612-9195-4
Categories:	Books > Computing & IT > Computer hardware & operating systems > Computer architecture & logic design > General Promotions
LSN:	1-4612-9195-X
Barcode:	9781461291954

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!