13752 search results - page 2427 / 2751 » Parallel and Distributed Haskells |
179
click to vote
SPAA
1999
ACM
15 years 9 months ago
1999
ACM
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
154
click to vote
HPDC
1999
IEEE
15 years 9 months ago
1999
IEEE
In this paper, we present the design and implementation of Dodo, an e cient user-level system for harvesting idle memory in o -the-shelf clusters of workstations. Dodo enables dat...
157
click to vote
ICDCS
1999
IEEE
15 years 9 months ago
1999
IEEE
To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...
137
click to vote
ICDCS
1999
IEEE
15 years 9 months ago
1999
IEEE
Update anywhere-anytime-anyway transactional replication has unstable behavior as the workload scales up. To reduce this problem, a two-tier replication algorithm is proposed in [...
149
click to vote
IPPS
1999
IEEE
15 years 9 months ago
1999
IEEE
The rapid progress in high-performance microprocessor design has made it di cult to adapt real-time scheduling results to new models of microprocessor hardware, thus leaving an un...