Sciweavers

611 search results - page 79 / 123
» Highly scalable parallel sorting
Sort
View
ICDCS
1996
IEEE
14 years 28 days ago
An Evaluation of the Amoeba Group Communication System
The Amoeba group communication system has two unique aspects: (1) it uses a sequencer-based protocol with negative acknowledgements for achieving a total order on all group messag...
M. Frans Kaashoek, Andrew S. Tanenbaum
HPCN
1994
Springer
14 years 26 days ago
Experiments with HPF Compilation for a Network of Workstations
Abstract. High Performance Fortran (hpf) is a data-parallel Fortran for Distributed Memory Multiprocessors. Hpf provides an interesting programming model but compilers are yet to c...
Fabien Coelho
IPPS
2010
IEEE
13 years 6 months ago
Evaluating database-oriented replication schemes in Software Transactional Memory systems
Software Transactional Memories (STMs) are emerging as a highly attractive programming model, thanks to their ability to mask concurrency management issues to the overlying applic...
Roberto Palmieri, Francesco Quaglia, Paolo Romano,...
SIGMOD
2010
ACM
198views Database» more  SIGMOD 2010»
14 years 1 months ago
Continuous analytics over discontinuous streams
Continuous analytics systems that enable query processing over steams of data have emerged as key solutions for dealing with massive data volumes and demands for low latency. Thes...
Sailesh Krishnamurthy, Michael J. Franklin, Jeffre...
PPOPP
2003
ACM
14 years 2 months ago
Optimizing data aggregation for cluster-based internet services
Large-scale cluster-based Internet services often host partitioned datasets to provide incremental scalability. The aggregation of results produced from multiple partitions is a f...
Lingkun Chu, Hong Tang, Tao Yang, Kai Shen