3607 search results - page 623 / 722 » Distributed Parallel Computing Using Windows Desktop Systems |
132
Voted
CONCUR
2009
Springer
15 years 9 months ago
2009
Springer
Bisimulation equivalence is decidable in polynomial time for both sequential and commutative normed context-free processes, known as BPA and BPP, respectively. Despite apparent sim...
119
click to vote
JSA
2000
15 years 2 months ago
2000
Scheduling DAGs with communication times is the theoretical basis for achieving efficient parallelism on distributed memory systems. We generalize Graham's task-level in a ma...
138
click to vote
SLIP
2004
ACM
15 years 7 months ago
2004
ACM
Throughput, power consumption, signal integrity, pin count and routing complexity are all increasingly important interconnect issues that the system designer must deal with. Recen...
100
click to vote
IOPADS
1997
15 years 3 months ago
1997
As high-speed networks make it easier to use distributed resources, it becomes increasingly common that applications and their data are not colocated. Users have traditionally add...
132
Voted
ICDCS
1995
IEEE
15 years 6 months ago
1995
IEEE
nt formal speci cations of a new abstraction, weak sets, which can be used to alleviate high latencies when retrieving data from a wide-area information system like the World Wide...