967 search results - page 34 / 194 » Multi-users scheduling in parallel systems |
SPAA
2006
ACM
14 years 1 months ago
2006
ACM
Suppose we have a parallel or distributed system whose nodes have limited capacities, such as processing speed, bandwidth, memory, or disk space. How does the performance of the s...
EPIA
1999
Springer
14 years 4 hour ago
1999
Springer
YapOr is an or-parallel system that extends the Yap Prolog system to exploit implicit or-parallelism in Prolog programs. It is based on the environment copying model, as first imp...
ICC
2007
IEEE
14 years 2 months ago
2007
IEEE
— Generalized selection multiuser diversity (GSMuD) is a new scheduling scheme which provides a near-optimal low-complexity solution to parallel access multiuser scheduling. In t...
CCGRID
2009
IEEE
14 years 2 months ago
2009
IEEE
In a cluster of multiple processors or cpu-cores, many processes may run on each compute node. Each process tends to issue contiguous I/O requests for snapshot, checkpointing or s...
JSSPP
1995
Springer
13 years 11 months ago
1995
Springer
During the past ve years scientists discovered that modern UNIX workstations connected with ethernet and ber networks could provide enough computational performance to compete wit...