Order Total (1 Item Items):
Shipping Destination:
Schwiegelshohn Uwe (144 results)
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (144)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition Learn more
- New (124)
- As New, Fine or Near Fine (13)
- Very Good or Good (7)
- Fair or Poor (No further results match this refinement)
- As Described (No further results match this refinement)
Binding
Collectible Attributes
- First Edition (No further results match this refinement)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (59)
- Not Print on Demand (103)
Language (1)
Free Shipping
Seller Location
Seller Rating
-
Paperback. Condition: Very Good. Ex-library paperback in very nice condition with the usual markings and attachments.
-
Job Scheduling Strategies for Parallel Processing: 10th International Workshop, JSSPP 2004, New York, NY, USA, June 13, 2004; Revised Selected Papers
Language: English
Published by Springer Verlag., New York, 2005
ISBN 10: 3540253300 ISBN 13: 9783540253303
Hardcover. Condition: Very Good. Hardcover in library binding 2005 edition. Ex-library book with stamps and labels attached. Binding firm. Pages unmarked and clean. Covers and text in very good condition. {315 pages}.
-
Paperback. Condition: Very Good. Ex-library paperback in very nice condition with the usual markings and attachments.
-
Job Scheduling Strategies for Parallel Processing: 8th International Workshop, JSSPP 2002, Edinburgh, Scotland, Uk, July 24, 2002 Revised Papers
Language: English
Published by Springer-Verlag, New York, 2002
ISBN 10: 3540001727 ISBN 13: 9783540001720
Hardcover. Condition: Very Good. No Jacket. Hardcover 2002 library bound edition. Ex-library book with stamps and labels attached. Binding firm. Pages unmarked and clean. Laminated covers and text in very good condition. Series: Lecture Notes in Computer Science ;2537.[235 p. : ill. ; 24 cm].
-
Condition: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.
-
Brand new book. Fast ship. Please provide full street address as we are not able to ship to P O box address.
-
Condition: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.
-
Condition: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.
-
Paperback. Condition: Very Good. Ex-library paperback in very nice condition with the usual markings and attachments.
-
Paperback. Condition: Very Good. Ex-library paperback in very nice condition with the usual markings and attachments.
-
-
-
Paperback. Condition: Very Good. Ex-library paperback in very nice condition with the usual markings and attachments.
-
Brand new book. Fast ship. Please provide full street address as we are not able to ship to P O box address.
-
-
-
-
-
-
-
-
-
-
-
Condition: New.
-
Condition: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.
-
Condition: As New. Unread book in perfect condition.
-
Condition: As New. Unread book in perfect condition.
-
US$ 17.05
Free Shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketPaperback. Condition: New. Print on Demand. This book introduces scheduling algorithms that help make the most of processor time on computers. It provides solutions to cyclical scheduling issues where tasks must be carried out repeatedly in a particular order. First, the author presents an efficient algorithm for generating optimum schedules when there are an unlimited number of processors. The second half of the book addresses the more complex issue of scheduling for a specific number of processors. The author provides an efficient algorithm that guarantees schedules within a small margin of optimality. The book ends with a discussion of how the ideas and algorithms presented can be applied to real-world scheduling problems. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item.
-
Brand new book. Fast ship. Please provide full street address as we are not able to ship to P O box address.
