Algorithm Engineering and Experimentation

Language: English

Published by Springer-Verlag Berlin and Heidelberg GmbH and Co. KG, DE, 1999

3540662278 / 9783540662273

  • Softcover
  • New
See all details

Seller: Rarewaves.com USA, London, London, United KingdomRarewaves.com USA

5-star seller

AbeBooks seller since June 11, 2025

View this seller's items
Softcover

Condition: New

£ 65.01

 Free Shipping 
Ships from United Kingdom to U.S.A.

Quantity: Over 20 available

Add to basket
Free 30-day returns

Item description from seller

Symmetric multiprocessors (SMPs) dominate the high-end server market and are currently the primary candidate for constructing large scale multiprocessor systems. Yet, the design of e cient parallel algorithms for this platform c- rently poses several challenges. The reason for this is that the rapid progress in microprocessor speed has left main memory access as the primary limitation to SMP performance. Since memory is the bottleneck, simply increasing the n- ber of processors will not necessarily yield better performance. Indeed, memory bus limitations typically limit the size of SMPs to 16 processors. This has at least twoimplicationsfor the algorithmdesigner. First, since there are relatively few processors availableon an SMP, any parallel algorithm must be competitive with its sequential counterpart with as little as one processor in order to be r- evant. Second, for the parallel algorithm to scale with the number of processors, it must be designed with careful attention to minimizing the number and type of main memory accesses. In this paper, we present a computational model for designing e cient al- rithms for symmetric multiprocessors. We then use this model to create e cient solutions to two widely di erent types of problems - linked list pre x com- tations and generalized sorting. Both problems are memory intensive, but in die rent ways. Whereas generalized sorting algorithms typically require a large numberofmemoryaccesses, they areusuallytocontiguousmemorylocations. By contrast, prex computation algorithms typically require a more modest qu- tity of memory accesses, but they are are usually to non-contiguous memory locations.…

Seller Inventory # LU-9783540662273

Title
Algorithm Engineering and Experimentation
Author
Michael T. Goodrich
Publisher
Springer-Verlag Berlin and Heidelberg GmbH and Co. KG, DE
Publication year
1999
Condition
New
Binding
Paperback
Language
English
ISBN 10
3540662278
ISBN 13
9783540662273
Edition
1999 ed.
Dimensions
15.49 x 2.08 x 23.5 cm

Rarewaves.com USA

London, London, United Kingdom

5-star seller

AbeBooks seller since June 11, 2025

Shipping rates from United Kingdom to U.S.A.

Item9 to 14 business days9 to 14 business days
First item£ 0.00£ 0.00
Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.

Payment methods

  • Visa
  • Mastercard
  • American Express
  • Apple Pay
  • Google Pay

Seller's business information

RAREWAVES.COM LIMITED

Elsley Court, 20-22 Great Titchfield Street
London, United Kingdom W1W 8BE