Data Portal @ linkeddatafragments.org

Matches in Harvard for { <http://id.lib.harvard.edu/aleph/008224492/catalog> ?p ?o. }

• catalog abstract "This work considers practical parallel list-ranking algorithms. The model for which programs are written is a single-program multiple-data (SPMD) \bri- ingmodel". Thismodel isdesignated asa programmer’smodelfora ne-grained computation framework called Explicit Multi-Threading (XMT), which was - troduced in [VDBN98]; the XMT framework covers the spectrum from al- rithms through architecture to implementation; it is meant to provide a pl- form for faster single-task completion time by way of instruction-level par- lelism (ILP). The performance of XMT programs is evaluated as follow: the performance of a matching optimized XMT assembly code is measured within an XMT execution model. (We use in the current paper the so-called Spawn- MT programmingmodel - the easier to implement amongthe two programming modelspresented in[VDBN98]). The XMT approach deviatesfromthe standard PRAM approach by incorporating reduced synchrony and departing from the lock-step structure in its so-called asynchronous mode. Our envisioned platform uses an extension to a standard serial instruction set. This extension e ciently implements PRAM-style algorithms using explicit multi-threaded ILP, which allows considerably more n e-grained parallelism than the previously studied parallel computing implementation platforms/models. The list ranking problem was the rst problem considered as we examined and re ned many of the concepts in the XMT framework. The problem arises in parallel algorithmson lists, trees and graphs and is considered a fundamental problemin the theory of parallelalgorithms. Experimental results are presented.".
• catalog contributor b11440410.
• catalog contributor b11440411.
• catalog contributor b11440412.
• catalog created "c1999.".
• catalog date "1999".
• catalog date "c1999.".
• catalog dateCopyrighted "c1999.".
• catalog description "Dijkstra's algorithm on-line: an empirical case study from public railroad transport / Frank Schulz, Dorothea Wagner, Karsten Weihe -- Implementation and experimental evaluation of graph connectivity algorithms using LEDA / Panagiota Fatourou [and others] -- On-line zone construction in arrangements of lines in the plane / Yuval Aharoni [and others] -- The design and implementation of planar maps in Cgal / Eyal Flato [and others] -- An easy to use implementation of linear perturbations within Cgal / Jochen Comes, Mark Ziegelmann -- Analysing cache effects in distribution sorting / Naila Rahman, Rajeev Raman -- Fast regular expression search / Gonzalo Nauarro, Mathieu Raffinot -- An experimental evaluation of hybrid data structures for searching / Maureen Korda, Rajeev Raman -- LEDA-SM: extending LEDA to secondary memory / Andreas Crauser, Kurt Mehlhorn -- A priority queue transform / Michael L. Fredman -- ".
• catalog description "Implementation issues and experimental study of a wavelength routing algorithm for irregular all-optical networks / Athanasios Bouganis, Ioannis Caragiannis, Christos Kaklamanis -- Estimating large distance in phylogenetic reconstruction / Daniel H. Huson, Kelly Ann Smith, Tandy J. Warnow -- The performance of concurrent red-black tree algorithms / Sabine Hanke -- Performance engineering case study: heap construction / Jesper Bojesen, Jyrki Katajainen, Maz Spork -- A fast and simple local search for graph coloring / Massimiliano Caramia, Paolo Dell'Olmo -- BALL: biochemical algorithms library / Nicolas Boghossian, Oliver Kohlbacher, Hans-Peter Lanhof -- An experimental study of priority queues in external memory / Klaus Brengel [and others].".
• catalog description "Includes bibliographical references and index.".
• catalog description "Selecting problems for algorithm evaluation / Andrew V. Goldberg -- BSP algorithms -- "write once, run anywhere" / Bill McColl -- Ten years of LEDA / Kurt Mehlhorn -- Computing the K shortest paths: a new algorithm and an experimental comparison / Victor M. Jimenez, Andrew Marzal -- Efficient implementation of lazy suffix trees / Robert Giegerich, Stefan Kurtz, Jens Stoye -- Experiments with list ranking for explicit multi-threaded (XMT) instruction parallelism / Shlomit Dascal, Uzi Vishkin -- Finding minimum congestion spanning trees / Renato Fonseca [and others] -- Evaluation of an algorithm for the transversal hypergraph problem / Dimitris J. Kavvadias, Elias C. Stavropoulos -- Construction heuristics and domination analysis for the asymmetric TSP / Fred Glover [and others] -- Counting in mobile networks: theory and experimentation / Kostas Hatzis [and others] -- ".
• catalog description "This work considers practical parallel list-ranking algorithms. The model for which programs are written is a single-program multiple-data (SPMD) \bri- ingmodel". Thismodel isdesignated asa programmer’smodelfora ne-grained computation framework called Explicit Multi-Threading (XMT), which was - troduced in [VDBN98]; the XMT framework covers the spectrum from al- rithms through architecture to implementation; it is meant to provide a pl- form for faster single-task completion time by way of instruction-level par- lelism (ILP). The performance of XMT programs is evaluated as follow: the performance of a matching optimized XMT assembly code is measured within an XMT execution model. (We use in the current paper the so-called Spawn- MT programmingmodel - the easier to implement amongthe two programming modelspresented in[VDBN98]). The XMT approach deviatesfromthe standard PRAM approach by incorporating reduced synchrony and departing from the lock-step structure in its so-called asynchronous mode. Our envisioned platform uses an extension to a standard serial instruction set. This extension e ciently implements PRAM-style algorithms using explicit multi-threaded ILP, which allows considerably more n e-grained parallelism than the previously studied parallel computing implementation platforms/models. The list ranking problem was the rst problem considered as we examined and re ned many of the concepts in the XMT framework. The problem arises in parallel algorithmson lists, trees and graphs and is considered a fundamental problemin the theory of parallelalgorithms. Experimental results are presented.".
• catalog extent "viii, 359 p. :".
• catalog identifier "3540664270 (alk. paper)".
• catalog isPartOf "Lecture notes in computer science, 0302-9743 ; 1668".
• catalog issued "1999".
• catalog issued "c1999.".
• catalog language "eng".
• catalog publisher "Berlin ; New York : Springer,".
• catalog subject "005.1 21".
• catalog subject "Combinatorics.".
• catalog subject "Computational complexity.".
• catalog subject "Computer Communication Networks.".
• catalog subject "Computer algorithms Congresses.".
• catalog subject "Computer science.".
• catalog subject "Computer software.".
• catalog subject "Electronic data processing.".
• catalog subject "QA76.9.A43 I59 1999".
• catalog subject "Software engineering Congresses.".
• catalog tableOfContents "Dijkstra's algorithm on-line: an empirical case study from public railroad transport / Frank Schulz, Dorothea Wagner, Karsten Weihe -- Implementation and experimental evaluation of graph connectivity algorithms using LEDA / Panagiota Fatourou [and others] -- On-line zone construction in arrangements of lines in the plane / Yuval Aharoni [and others] -- The design and implementation of planar maps in Cgal / Eyal Flato [and others] -- An easy to use implementation of linear perturbations within Cgal / Jochen Comes, Mark Ziegelmann -- Analysing cache effects in distribution sorting / Naila Rahman, Rajeev Raman -- Fast regular expression search / Gonzalo Nauarro, Mathieu Raffinot -- An experimental evaluation of hybrid data structures for searching / Maureen Korda, Rajeev Raman -- LEDA-SM: extending LEDA to secondary memory / Andreas Crauser, Kurt Mehlhorn -- A priority queue transform / Michael L. Fredman -- ".
• catalog tableOfContents "Implementation issues and experimental study of a wavelength routing algorithm for irregular all-optical networks / Athanasios Bouganis, Ioannis Caragiannis, Christos Kaklamanis -- Estimating large distance in phylogenetic reconstruction / Daniel H. Huson, Kelly Ann Smith, Tandy J. Warnow -- The performance of concurrent red-black tree algorithms / Sabine Hanke -- Performance engineering case study: heap construction / Jesper Bojesen, Jyrki Katajainen, Maz Spork -- A fast and simple local search for graph coloring / Massimiliano Caramia, Paolo Dell'Olmo -- BALL: biochemical algorithms library / Nicolas Boghossian, Oliver Kohlbacher, Hans-Peter Lanhof -- An experimental study of priority queues in external memory / Klaus Brengel [and others].".
• catalog tableOfContents "Selecting problems for algorithm evaluation / Andrew V. Goldberg -- BSP algorithms -- "write once, run anywhere" / Bill McColl -- Ten years of LEDA / Kurt Mehlhorn -- Computing the K shortest paths: a new algorithm and an experimental comparison / Victor M. Jimenez, Andrew Marzal -- Efficient implementation of lazy suffix trees / Robert Giegerich, Stefan Kurtz, Jens Stoye -- Experiments with list ranking for explicit multi-threaded (XMT) instruction parallelism / Shlomit Dascal, Uzi Vishkin -- Finding minimum congestion spanning trees / Renato Fonseca [and others] -- Evaluation of an algorithm for the transversal hypergraph problem / Dimitris J. Kavvadias, Elias C. Stavropoulos -- Construction heuristics and domination analysis for the asymmetric TSP / Fred Glover [and others] -- Counting in mobile networks: theory and experimentation / Kostas Hatzis [and others] -- ".
• catalog title "Algorithm engineering : 3rd International Workshop, WAE'99 London, UK, July 19-21, 1999 : proceedings / Jeffrey S. Vitter, Christos D. Zaroliagis (eds.).".
• catalog type "Conference proceedings. fast".
• catalog type "London (1999) swd".
• catalog type "text".