LEADER 05891nam 22008535 450 001 9910767569803321 005 20250730104727.0 010 $a3-540-48518-X 024 7 $a10.1007/3-540-48518-X 035 $a(CKB)1000000000211181 035 $a(SSID)ssj0000321161 035 $a(PQKBManifestationID)11255087 035 $a(PQKBTitleCode)TC0000321161 035 $a(PQKBWorkID)10259808 035 $a(PQKB)10548741 035 $a(DE-He213)978-3-540-48518-6 035 $a(MiAaPQ)EBC3072284 035 $a(MiAaPQ)EBC6495016 035 $a(PPN)155221469 035 $a(EXLCZ)991000000000211181 100 $a20121227d1999 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAlgorithm Engineering and Experimentation $eInternational Workshop ALENEX'99 Baltimore, MD, USA, January 15-16, 1999, Selected Papers /$fedited by Michael T. Goodrich, Catherine C. McGeoch 205 $a1st ed. 1999. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1999. 215 $a1 online resource (VIII, 356 p.) 225 1 $aLecture Notes in Computer Science,$x1611-3349 ;$v1619 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-540-66227-8 320 $aIncludes bibliographical references and index. 327 $aCombinatorial Algorithms -- Efficient Implementation of the WARM-UP Algorithm for the Construction of Length-Restricted Prefix Codes -- Implementing Weighted b-Matching Algorithms: Insights from a Computational Study -- Designing Practical Efficient Algorithms for Symmetric Multiprocessors -- Circular Drawings of Biconnected Graphs -- Heuristics and Experimental Design for Bigraph Crossing Number Minimization -- Binary Space Parititions in Plücker Space -- Practical Point-in-Polygon Tests Using CSG Representations of Polygons -- Software and Applications -- Accessing the Internal Organization of Data Structures in the JDSL Library -- Object-Oriented Design of Graph Oriented Data Structures -- A Case Study on the Cost of Geometric Computing -- Design and Implementation of the Fiduccia-Mattheyses Heuristic for VLSI Netlist Partitioning -- Algorithms for Restoration Planning in a Telecommunications Network -- Computing the n × m Shortest Paths Efficiently -- Image Watermarking for Copyright Protection -- Algorithms for NP-Hard Problems -- A Self Organizing Bin Packing Heuristic -- Finding the Right Cutting Planes for the TSP -- Obstacle-Avoiding Euclidean Steiner Trees in the Plane: An Exact Algorithm -- Data Structures -- Adaptive Algorithms for Cache-efficient Trie Search -- Fast Priority Queues for Cached Memory -- Efficient Bulk Operations on Dynamic R-trees. 330 $aSymmetric 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. 410 0$aLecture Notes in Computer Science,$x1611-3349 ;$v1619 606 $aComputer programming 606 $aData structures (Computer science) 606 $aInformation theory 606 $aApplication software 606 $aAlgorithms 606 $aArtificial intelligence$xData processing 606 $aComputer graphics 606 $aProgramming Techniques 606 $aData Structures and Information Theory 606 $aComputer and Information Systems Applications 606 $aAlgorithms 606 $aData Science 606 $aComputer Graphics 615 0$aComputer programming. 615 0$aData structures (Computer science) 615 0$aInformation theory. 615 0$aApplication software. 615 0$aAlgorithms. 615 0$aArtificial intelligence$xData processing. 615 0$aComputer graphics. 615 14$aProgramming Techniques. 615 24$aData Structures and Information Theory. 615 24$aComputer and Information Systems Applications. 615 24$aAlgorithms. 615 24$aData Science. 615 24$aComputer Graphics. 676 $a005.1 702 $aGoodrich$b Michael T. 702 $aMcGeoch$b Catherine C.$f1959- 712 12$aALENEX '99 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910767569803321 996 $aAlgorithm Engineering and Experimentation$92165839 997 $aUNINA