0
Your cart

Your cart is empty

Books > Computing & IT > Applications of computing > Databases

Buy Now

Algorithm Engineering and Experimentation - International Workshop ALENEX'99 Baltimore, MD, USA, January 15-16, 1999, Selected Papers (Paperback, 1999 ed.) Loot Price: R1,696
Discovery Miles 16 960
Algorithm Engineering and Experimentation - International Workshop ALENEX'99 Baltimore, MD, USA, January 15-16, 1999,...

Algorithm Engineering and Experimentation - International Workshop ALENEX'99 Baltimore, MD, USA, January 15-16, 1999, Selected Papers (Paperback, 1999 ed.)

Michael T Goodrich, Catherine C. McGeoch

Series: Lecture Notes in Computer Science, 1619

 (sign in to rate)
Loot Price R1,696 Discovery Miles 16 960 | Repayment Terms: R159 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 working days

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.

General

Imprint: Springer-Verlag
Country of origin: Germany
Series: Lecture Notes in Computer Science, 1619
Release date: 2001
First published: 1999
Editors: Michael T Goodrich • Catherine C. McGeoch
Dimensions: 235 x 155 x 19mm (L x W x T)
Format: Paperback
Pages: 356
Edition: 1999 ed.
ISBN-13: 978-3-540-66227-3
Categories: Books > Computing & IT > General theory of computing > Data structures
Books > Computing & IT > Computer programming > Algorithms & procedures
Books > Computing & IT > Computer software packages > Multimedia
Books > Computing & IT > Applications of computing > Databases > General
Promotions
LSN: 3-540-66227-8
Barcode: 9783540662273

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!

You might also like..

Database Principles - Fundamentals of…
Carlos Coronel, Keeley Crockett, … Paperback R1,099 R969 Discovery Miles 9 690
Management Of Information Security
Michael Whitman, Herbert Mattord Paperback R1,321 R1,229 Discovery Miles 12 290
The Data Quality Blueprint - A Practical…
John Parkinson Hardcover R1,671 Discovery Miles 16 710
Database Solutions - A step by step…
Thomas Connolly, Carolyn Begg Paperback R2,244 R2,122 Discovery Miles 21 220
CompTIA Data+ DA0-001 Exam Cram
Akhil Behl, Sivasubramanian Digital product license key R1,735 R1,064 Discovery Miles 10 640
Intro to Python for Computer Science and…
Paul Deitel Paperback R2,143 Discovery Miles 21 430
Database Design & Management Using…
Nick Dowling Hardcover R3,894 Discovery Miles 38 940
Rethinking the Regulation of…
Syren Johnstone Hardcover R3,504 Discovery Miles 35 040
Blockchain Life - Making Sense of the…
Kary Oberbrunner, Lee Richter Hardcover R578 R529 Discovery Miles 5 290
Cybersecurity in Smart Homes…
Khatoun Hardcover R3,793 Discovery Miles 37 930
Applied Big Data Analytics and Its Role…
Peng Zhao, Xin Wang, … Hardcover R7,392 Discovery Miles 73 920
Advanced SQL with SAS
Christian F. G. Schendera Hardcover R2,559 Discovery Miles 25 590

See more

Partners