28821 search results - page 171 / 5765 » Distributed and parallel systems |
131
click to vote
ENTCS
2007
15 years 3 months ago
2007
Formal sequentialization is introduced as a rewriting process for the reduction of parallelism and internal communication statements of distributed imperative programs. It constru...
119
click to vote
ICPP
1999
IEEE
15 years 7 months ago
1999
IEEE
This paper describes a novel compile-time list-based task scheduling algorithm for distributed-memory systems, called Fast Load Balancing (FLB). Compared to other typical list sch...
128
click to vote
ICPP
2000
IEEE
15 years 6 months ago
2000
IEEE
The idle computers on a local area, campus area, or even wide area network represent a significant computational resource--one that is, however, also unreliable, heterogeneous, an...
114
click to vote
IPPS
2007
IEEE
15 years 9 months ago
2007
IEEE
In this paper, we present an asynchronous consistent global checkpoint collection algorithm which prevents contention for network storage at the file server and hence reduces the...
84
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
This paper presents a realization for the reliable and fast startup of distributed systems written in Erlang. The traditional startup provided by the Erlang/OTP library is sequenti...