+612 9045 4394
$7.95 Delivery per order to Australia and New Zealand
100% Australian owned
Over a hundred thousand in-stock titles ready to ship
Algorithm Engineering and Experimentation : International Workshop Alenex'99 Baltimore, MD, Usa, January 15-16, 1999, Selected Papers - Michael T. Goodrich

Algorithm Engineering and Experimentation

International Workshop Alenex'99 Baltimore, MD, Usa, January 15-16, 1999, Selected Papers

By: Michael T. Goodrich (Editor), Catherine C. McGeoch (Editor)

Paperback Published: 29th June 1999
ISBN: 9783540662273
Number Of Pages: 356

Share This Book:


or 4 easy payments of $36.76 with Learn more
Ships in 10 to 15 business days

Earn 294 Qantas Points
on this Book

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.

Efficient implementation of the WARM-UP algorithm for the construction of length-restricted prefix codesp. 1
Implementing weighted b-matching algorithms: Insights from a computational studyp. 18
Designing practical efficient algorithms for symmetric multiprocessorsp. 37
Circular drawings of biconnected graphsp. 57
Heuristics and experimental design for bigraph crossing number minimizationp. 74
Binary space partitions in Plucker spacep. 94
Practical point-in-polygon tests using CSG representations of polygonsp. 114
Accessing the internal organization of data structures in the JDSL libraryp. 124
Object-oriented design of graph oriented data structuresp. 140
A case study on the cost of geometric computingp. 156
Design and implementation of the Fiduccia-Mattheyses heuristic for VLSI netlist partitioningp. 177
Algorithms for restoration planning in a telecommunications networkp. 194
Computing the nxm shortest paths efficientlyp. 210
Image watermarking for copyright protectionsp. 226
A self organizing bin packing heuristicp. 246
Finding the right cutting planes for the TSPp. 266
Obstacle-avoiding Euclidean Steiner Trees in the plane: An exact algorithmp. 282
Adaptive algorithms for cache-efficient trie searchp. 296
Fast priority queues for cached memoryp. 312
Efficient bulk operations on dynamic R-treesp. 328
Author Indexp. 349
Table of Contents provided by Blackwell. All Rights Reserved.

ISBN: 9783540662273
ISBN-10: 3540662278
Series: Lecture Notes in Computer Science
Audience: General
Format: Paperback
Language: English
Number Of Pages: 356
Published: 29th June 1999
Country of Publication: DE
Dimensions (cm): 23.39 x 15.6  x 1.91
Weight (kg): 0.51

Earn 294 Qantas Points
on this Book