Please note: In order to keep Hive up to date and provide users with the best features, we are no longer able to fully support Internet Explorer. The site is still available to you, however some sections of the site may appear broken. We would encourage you to move to a more modern browser like Firefox, Edge or Chrome in order to experience the site fully.

Scheduling for Parallel Processing, Hardback Book

Scheduling for Parallel Processing Hardback

Part of the Computer Communications and Networks series

Hardback

Description

Overview and Goals This book is dedicated to scheduling for parallel processing.

Presenting a research ?eld as broad as this one poses considerable dif?culties.

Scheduling for parallel computing is an interdisciplinary subject joining many ?elds of science and te- nology.

Thus, to understand the scheduling problems and the methods of solving them it is necessary to know the limitations in related areas.

Another dif?culty is that the subject of scheduling parallel computations is immense.

Even simple search in bibliographical databases reveals thousands of publications on this topic.

The - versity in understanding scheduling problems is so great that it seems impossible to juxtapose them in one scheduling taxonomy.

Therefore, most of the papers on scheduling for parallel processing refer to one scheduling problem resulting from one way of perceiving the reality.

Only a few publications attempt to arrange this ?eld of knowledge systematically.

In this book we will follow two guidelines. One guideline is a distinction - tween scheduling models which comprise a set of scheduling problems solved by dedicated algorithms.

Thus, the aim of this book is to present scheduling models for parallel processing, problems de?ned on the grounds of certain scheduling models, and algorithms solving the scheduling problems.

Most of the scheduling problems are combinatorial in nature.

Therefore, the second guideline is the methodology of computational complexity theory.

Inthisbookwepresentfourexamplesofschedulingmodels. Wewillgodeepinto the models, problems, and algorithms so that after acquiring some understanding of them we will attempt to draw conclusions on their mutual relationships.

Information

  • Format:Hardback
  • Pages:386 pages, 41 Tables, black and white; 100 Illustrations, black and white; XIV, 386 p. 100 illus.
  • Publisher:Springer London Ltd
  • Publication Date:
  • Category:
  • ISBN:9781848823099

Other Formats

Save 13%

£132.00

£114.25

Item not Available
 
Free Home Delivery

on all orders

 
Pick up orders

from local bookshops

Information

  • Format:Hardback
  • Pages:386 pages, 41 Tables, black and white; 100 Illustrations, black and white; XIV, 386 p. 100 illus.
  • Publisher:Springer London Ltd
  • Publication Date:
  • Category:
  • ISBN:9781848823099

Also in the Computer Communications and Networks series  |  View all