Scheduling parallel processing par drozdowski maciej (21 résultats)

Etat : New.

Etat : New. In English.

Etat : New. In English.

Etat : New.

Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.…

Etat : New. pp. 404.

Etat : New. pp. 402.

Taschenbuch. Etat : Neu. Scheduling for Parallel Processing | Maciej Drozdowski | Taschenbuch | Computer Communications and Networks | xiv | Englisch | 2012 | Springer | EAN 9781447125082 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. …

Etat : Sehr gut. Zustand: Sehr gut | Seiten: 386 | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar.

Etat : As New. Unread book in perfect condition.

Hardcover. Etat : Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Paperback. Etat : Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Etat : As New. Unread book in perfect condition.

Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 400 pp. Englisch.…

Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 .…

Gebunden. Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 .…

Etat : New. Print on Demand pp. 404 100 Illus.

Taschenbuch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 400 pp. Englisch.…

Etat : New. Print on Demand pp. 402 Illus.

Etat : New. PRINT ON DEMAND pp. 404.

Etat : New. PRINT ON DEMAND pp. 402.