Sciweavers

1415 search results - page 109 / 283
» Can Parallel Algorithms Enhance Serial Implementation
Sort
View
IOPADS
1997
152views more  IOPADS 1997»
15 years 3 months ago
Competitive Parallel Disk Prefetching and Buffer Management
We provide a competitive analysis framework for online prefetching and buffer management algorithms in parallel I/O systems, using a read-once model of block references. This has ...
Rakesh D. Barve, Mahesh Kallahalla, Peter J. Varma...
CIAC
2000
Springer
210views Algorithms» more  CIAC 2000»
15 years 6 months ago
Computing a Diameter-Constrained Minimum Spanning Tree in Parallel
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
Narsingh Deo, Ayman Abdalla
110
Voted
DATE
2003
IEEE
180views Hardware» more  DATE 2003»
15 years 7 months ago
Communication Centric Architectures for Turbo-Decoding on Embedded Multiprocessors
Software implementations of channel decoding algorithms are attractive for communication systems with their large variety of existing and emerging standards due to their flexibil...
Frank Gilbert, Michael J. Thul, Norbert Wehn
216
Voted
SIGMOD
2005
ACM
162views Database» more  SIGMOD 2005»
16 years 2 months ago
Clio grows up: from research prototype to industrial tool
Clio, the IBM Research system for expressing declarative schema mappings, has progressed in the past few years from a research prototype into a technology that is behind some of I...
Laura M. Haas, Mauricio A. Hernández, Howar...
CGO
2009
IEEE
15 years 9 months ago
Reducing Memory Ordering Overheads in Software Transactional Memory
—Most research into high-performance software transactional memory (STM) assumes that transactions will run on a processor with a relatively strict memory model, such as Total St...
Michael F. Spear, Maged M. Michael, Michael L. Sco...