1057 search results - page 134 / 212 » its 1998 |
IPPS
1998
IEEE
15 years 2 months ago
1998
IEEE
We study the problem of mapping the N nodes of a complete t-ary tree on M memory modules so that they can be accessed in parallel by templates, i.e. distinct sets of nodes. Typica...
IPPS
1998
IEEE
15 years 2 months ago
1998
IEEE
Counting networks were introduced as a new class of concurrent, distributed, low contention data structures suitable for implementing shared counters. Their structure is similar t...
108
click to vote
IPPS
1998
IEEE
15 years 2 months ago
1998
IEEE
Schedulinglarge task graphsis an importantissue in parallel computingsince it allowsthe treatment of big size problems. In this paper we tackle the following problem: how to sched...
IPPS
1998
IEEE
15 years 2 months ago
1998
IEEE
Scheduling jobs on the IBM SP2 system is usually done by giving each job a partition of the machine for its exclusive use. Allocating such partitions in the order that the jobs ar...
IPPS
1998
IEEE
15 years 2 months ago
1998
IEEE
As part of its HiPer-D Program, the United States Navy is developing an experimental distributed system which achieves survivability by dynamically reconfiguring the system using ...