Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID8th SPAA 1996: Padua, Italy
- Guy E. Blelloch:
Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA '96, Padua, Italy, June 24-26, 1996. ACM 1996, ISBN 0-89791-809-6
Session 1
- Mark W. Goudreau, Kevin J. Lang, Satish Rao, Torsten Suel, Thanasis Tsantilas:
Towards Efficiency and Portability: Programming with the BSP Model. 1-12 - Harry A. G. Wijshoff, Ben H. H. Juurlink:
A Quantitative Comparison of Parallel Computation Models. 13-24 - Gianfranco Bilardi, Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci
, Paul G. Spirakis:
BSP vs LogP. 25-32
Session 2
- Nir Shavit, Eli Upfal, Asaph Zemach:
A Steady State Analysis of Diffracting Trees (Extended Abstract). 33-41 - Micah Adler:
Asynchronous Shared Memory Search Structures. 42-51 - Matthew Andrews, Frank Thomson Leighton, Panagiotis Takis Metaxas, Lisa Zhang:
Improved Methods for Hiding Latency in High Bandwidth Networks (Extended Abstract). 52-61 - Jaspal Subhlok, Gary Vondran:
Optimal Latency-Throughput Tradeoffs for Data Parallel Pipelines. 62-71
Session 3
- Bhaskar Ghosh, S. Muthukrishnan, Martin H. Schultz:
First and Second Order Diffusive Methods for Rapid, Coarse, Distributed Load Balancing (Extended Abstract). 72-81 - Xiaotie Deng, Patrick W. Dymond:
On Multiprocessor System Scheduling. 82-88 - Mark S. Squillante, Fang Wang, Marios C. Papaefthymiou:
An Analysis of Gang Scheduling for Multiprogrammed Parallel Computing Environments. 89-98
Session 4
- Eric J. Schwabe, Ian M. Sutherland:
Flexible Usage of Parity Storage Space in Disk Arrays. 99-108 - Rakesh D. Barve, Edward F. Grove, Jeffrey Scott Vitter:
Simple Randomized Mergesort on Parallel Disks. 109-118 - Vivek Sarkar, Barbara Simons:
Anticipatory Instruction Scheduling. 119-130
Session 5
- Richard Cole, Bruce M. Maggs, Ramesh K. Sitaraman:
On the Benefit of Supporting Virtual Channels in Wormhole Routers. 131-141 - Christian Scheideler, Berthold Vöcking:
Universal Continuous Routing Strategies. 141-151 - Ralf Rehrmann, Burkhard Monien, Reinhard Lüling, Ralf Diekmann:
On the Communication Throughput of Buffered Multistage Interconnection Networks. 152-161 - Michael Mitzenmacher:
Constant Time per Edge is Optimal on Rooted Tree Networks. 162-169
Session 6
- Aythan Avior, Tiziana Calamoneri, Shimon Even, Ami Litman, Arnold L. Rosenberg:
A Tight Layout of the Butterfly Network. 170-175 - Kevin J. Rappoport:
On the Slowdown of Efficient Simulations of Multibutterflies on Butterflies and Butterfly-Derived Networks. 176-182 - Pierre Fraigniaud, Cyril Gavoille:
Local Memory Requirement of Universal Routing Schemes. 183-188
Session 7 (Research Summaries)
- Andrew Sohn, Rupak Biswas, Horst D. Simon:
A Dynamic Load Balancing Framework for Unstructured Adaptive Computations on Distributed-Memory Multiprocessors. 189-192 - Christoph W. Keßler, Jesper Larsson Träff:
A Library of Basic PRAM Algorithms and its Implementation in FORK. 193-195 - Peter A. Buhr, Anil K. Goel, Naomi Nishimura, Prabhakar Ragde:
µDatabase: Parallelism in a Memory-Mapped Environment. 196-199 - Thomas Stricker, Jonathan C. Hardwick:
From AAPC Algorithms to High Performance Permutation Routing and Sorting. 200-203 - David A. Hutchinson, L. Küttner, Mark Lanthier, Anil Maheshwari, Doron Nussbaum, David Roytenberg, Jörg-Rüdiger Sack:
Parallel Neighborhood Modeling. 204-207 - Ludmila Cherkasova, Al Davis, Robin Hodgson, Vadim E. Kotov, Ian N. Robinson, Tomas Rokicki:
Components of Congestion Control. 208-210
Session 8
- David R. Helman, David A. Bader, Joseph F. JáJá:
Parallel Algorithms for Personalized Communication and Sorting with an Experimental Study (Extended Abstract). 211-222 - Alexandros V. Gerbessiotis, Constantinos J. Siniolakis:
Deterministic Sorting and Randomized Median Finding on the BSP Model. 223-232 - Armin Bäumker, Wolfgang Dittrich:
Fully Dynamic Search Trees for an Extension of the BSP Model. 233-242
Session 9
- Richard Cole, Philip N. Klein, Robert Endre Tarjan:
Finding Minimum Spanning Forests in Logarithmic Time and Linear Work Using Random Sampling. 243-250 - Sandeep Sen:
Parallel Multidimensional Search Using Approximation Algorithms: With Applications to Linear-Programming and Related Problems. 251-260 - Volker Stemann:
Parallel Balanced Allocations. 261-269 - Yonatan Aumann, Michael A. Bender, Lisa Zhang:
Efficient Execution of Nondeterministic Parallel Programs on Asynchronous Systems. 270-276
Session 10
- Liviu Iftode, Jaswinder Pal Singh, Kai Li:
Scope Consistency: A Bridge Between Release Consistency and Entry Consistency. 277-287 - Seungjoon Park, David L. Dill:
Verification of FLASH Cache Coherence Protocol by Aggregation of Distributed Transactions. 288-296 - Robert D. Blumofe, Matteo Frigo, Christopher F. Joerg, Charles E. Leiserson, Keith H. Randall:
An Analysis of Dag-Consistent Distributed Shared-Memory Algorithms. 297-308
Session 11
- Lixin Gao, Arnold L. Rosenberg, Ramesh K. Sitaraman:
On Trading Task Reallocation for Thread Management in Partitionable Multiprocessors. 309-317 - Susan Flynn Hummel, Jeanette P. Schmidt, R. N. Uma, Joel Wein:
Load-Sharing in Heterogeneous Systems via Weighted Factoring. 318-328 - Soumen Chakrabarti, S. Muthukrishnan:
Resource Scheduling for Parallel Database and Scientific Applications. 329-335
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-26 18:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
