Sciweavers

1113 search results - page 100 / 223
» Performance under Failures of DAG-based Parallel Computing
Sort
View
SPAA
2003
ACM
15 years 7 months ago
A proportionate fair scheduling rule with good worst-case performance
In this paper we consider the following scenario. A set of n jobs with different threads is being run concurrently. Each job has an associated weight, which gives the proportion ...
Micah Adler, Petra Berenbrink, Tom Friedetzky, Les...
PPAM
2005
Springer
15 years 8 months ago
Checkpointing Speculative Distributed Shared Memory
This paper describes a checkpointing mechanism destined for Distributed Shared Memory (DSM) systems with speculative prefetching. Speculation is a general technique involving predi...
Arkadiusz Danilecki, Anna Kobusinska, Michal Szych...
164
Voted
SSDBM
1999
IEEE
140views Database» more  SSDBM 1999»
15 years 6 months ago
An Infrastructure for Scalable Parallel Multidimensional Analysis
Multidimensional Analysis in On-Line Analytical Processing (OLAP), and Scientific and statistical databases (SSDB) use operations requiring summary information on multi-dimensiona...
Sanjay Goil, Alok N. Choudhary
IM
2007
15 years 3 months ago
Robust Monitoring of Network-wide Aggregates through Gossiping
Abstract—We investigate the use of gossip protocols for continuous monitoring of network-wide aggregates under crash failures. Aggregates are computed from local management varia...
Fetahi Wuhib, Mads Dam, Rolf Stadler, Alexander Cl...
SWAT
1992
Springer
101views Algorithms» more  SWAT 1992»
15 years 6 months ago
Parallel Algorithms for Priority Queue Operations
This paper presents parallel algorithms for priority queue operations on a p-processor EREWPRAM. The algorithms are based on a new data structure, the Min-path Heap (MH), which is...
Maria Cristina Pinotti, Geppino Pucci