255 search results - page 32 / 51 » Efficient Optimistic Parallel Simulations Using Reverse Comp... |
103
click to vote
COCOON
1998
Springer
15 years 1 months ago
1998
Springer
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
71
Voted
IPPS
2010
IEEE
14 years 7 months ago
2010
IEEE
The majority of CPUs now sold contain multiple computing cores. However, current desktop grid computing systems either ignore the multiplicity of cores, or treat them as distinct,...
75
Voted
IPPS
2006
IEEE
15 years 3 months ago
2006
IEEE
P2P Networks are highly dynamic structures since their nodes – peer users keep joining and leaving continuously. In the paper, we study the effects of network change rates on qu...
CCGRID
2004
IEEE
15 years 1 months ago
2004
IEEE
Peer-to-peer (P2P) file-sharing applications generate a large part if not most of today's Internet traffic. The large volume of this traffic (thus the high potential benefits...
ESCIENCE
2007
IEEE
15 years 4 months ago
2007
IEEE
Effective scheduling is a key concern for the execution of performance driven Grid applications. In this paper, we propose a Dynamic Critical Path (DCP) based workflow scheduling ...