Sciweavers

7683 search results - page 1425 / 1537
» Distributed Computing with the CLAN Network
Sort
View
IPPS
1999
IEEE
15 years 8 months ago
Reducing I/O Complexity by Simulating Coarse Grained Parallel Algorithms
Block-wise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is fully par...
Frank K. H. A. Dehne, David A. Hutchinson, Anil Ma...
IPPS
1999
IEEE
15 years 8 months ago
Run-Time Selection of Block Size in Pipelined Parallel Programs
Parallelizing compiler technology has improved in recent years. One area in which compilers have made progress is in handling DOACROSS loops, where crossprocessor data dependencie...
David K. Lowenthal, Michael James
MOBISYS
2009
ACM
16 years 4 months ago
Longitudinal study of a building-scale RFID ecosystem
Radio Frequency IDentification (RFID) deployments are becoming increasingly popular in both industrial and consumer-oriented settings. To effectively exploit and operate such depl...
Evan Welbourne, Karl Koscher, Emad Soroush, Magdal...
146
Voted
CCGRID
2009
IEEE
15 years 10 months ago
Natively Supporting True One-Sided Communication in
As high-end computing systems continue to grow in scale, the performance that applications can achieve on such large scale systems depends heavily on their ability to avoid explic...
Gopalakrishnan Santhanaraman, Pavan Balaji, K. Gop...
CORR
2010
Springer
142views Education» more  CORR 2010»
15 years 2 months ago
HyperANF: Approximating the Neighbourhood Function of Very Large Graphs on a Budget
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
Paolo Boldi, Marco Rosa, Sebastiano Vigna
« Prev « First page 1425 / 1537 Last » Next »