6939 search results - page 266 / 1388 » Algorithm Engineering for Parallel Computation |
168
click to vote
IPPS
1999
IEEE
15 years 10 months ago
1999
IEEE
Abstract. In this paper we suggest a strategy to design job scheduling systems. To this end, we first split a scheduling system into three components: Scheduling policy, objective ...
176
Voted
IPPS
1999
IEEE
15 years 10 months ago
1999
IEEE
To support incremental replay of message-passing applications, processes must periodically checkpoint and the content of some messages must be logged, to break dependencies of the...
143
Voted
ICPADS
1998
IEEE
15 years 10 months ago
1998
IEEE
: Three fast mutual exclusion algorithms using read-modify-write and atomic read/write registers are presented in a sequence, with an improvement from one to the next. The last alg...
158
click to vote
IPPS
1997
IEEE
15 years 10 months ago
1997
IEEE
The k-merge problem, given a collection of k, (2 k n), sorted sequences of total length n, asks to merge them into a new sorted sequence. The main contribution of this work is...
157
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
One of the most fundamental problems in large-scale network analysis is to determine the importance of a particular node in a network. Betweenness centrality is the most widely us...