22 search results - page 3 / 5 » Allowing each node to communicate only once in a distributed... |
ICDCS
1991
IEEE
13 years 8 months ago
1991
IEEE
of ‘‘network computers’’ is inherently lessAbstract predictable than that of more traditional distributed memory systems, such as hypercubes [22], since both theFor computa...
SC
2009
ACM
13 years 11 months ago
2009
ACM
The availability of large quantities of processors is a crucial enabler of many-task computing. Voluntary computing systems have proven that it is possible to build computing plat...
CCS
2009
ACM
13 years 11 months ago
2009
ACM
Network information distribution is a fundamental service for any anonymization network. Even though anonymization and information distribution about the network are two orthogona...
IWQOS
2004
Springer
13 years 10 months ago
2004
Springer
— We propose an algorithm for design and on the fly modification of the schedule of a wireless ad hoc network for provision of fair service guarantees under topological changes...
SIGMOD
1996
ACM
13 years 8 months ago
1996
ACM
Scheduling query execution plans is an important component of query optimization in parallel database systems. The problem is particularly complex in a shared-nothing execution en...