5448 search results - page 568 / 1090 » Breakpoints and Time in Distributed Computations |
164
click to vote
CSR
2007
Springer
16 years 1 months ago
2007
Springer
Consider a family of sets and a single set, called query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Strict time cons...
199
click to vote
IPPS
2006
IEEE
16 years 1 months ago
2006
IEEE
Chip multiprocessors (CMPs) are becoming a popular way of exploiting ever-increasing number of on-chip transistors. At the same time, the location of data on the chip can play a c...
189
click to vote
PODC
2005
ACM
16 years 20 days ago
2005
ACM
The obstruction-free Dynamic Software Transactional Memory (DSTM) system of Herlihy et al. allows only one transaction at a time to acquire an object for writing. Should a second ...
206
click to vote
GRID
2004
Springer
16 years 15 days ago
2004
Springer
In this paper, we present a resource conscious dynamic scheduling strategy for handling large volume computationally intensive loads in a Grid system involving multiple sources an...
176
click to vote
ICPP
2003
IEEE
16 years 12 days ago
2003
IEEE
In this paper, we propose a priority-based balanced routing scheme, called the priority STAR routing scheme, which leads to optimal throughput and average delay at the same time f...