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,676
Discovery Miles 16 760
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,676 Discovery Miles 16 760 | Repayment Terms: R157 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 R949 Discovery Miles 9 490
Management Of Information Security
Michael Whitman, Herbert Mattord Paperback R1,321 R1,183 Discovery Miles 11 830
Safety of Web Applications - Risks…
Eric Quinton Hardcover R2,405 Discovery Miles 24 050
Big Data and Smart Service Systems
Xiwei Liu, Rangachari Anand, … Hardcover R2,044 R1,885 Discovery Miles 18 850
Temporal Data Mining via Unsupervised…
Yun Yang Paperback R1,199 Discovery Miles 11 990
Ontologies, Taxonomies and Thesauri in…
Emilia Curras Paperback R1,353 Discovery Miles 13 530
Machine Learning and Data Mining
I Kononenko, M Kukar Paperback R1,960 Discovery Miles 19 600
Open Source Database Driven Web…
Isaac Dunlap Paperback R1,185 Discovery Miles 11 850
Fundamentals of Spatial Information…
Robert Laurini, Derek Thompson Hardcover R1,490 Discovery Miles 14 900
The Data Quality Blueprint - A Practical…
John Parkinson Hardcover R1,651 Discovery Miles 16 510
Database Solutions - A step by step…
Thomas Connolly, Carolyn Begg Paperback R2,244 R2,102 Discovery Miles 21 020
CompTIA Data+ DA0-001 Exam Cram
Akhil Behl, Sivasubramanian Digital product license key R1,715 R1,044 Discovery Miles 10 440

See more

Partners