Sciweavers

5640 search results - page 771 / 1128
» Parallelizing the Data Cube
Sort
View
120
Voted
HPDC
1999
IEEE
15 years 7 months ago
Remote Application Scheduling on Metacomputing Systems
Efficient and robust metacomputing requires the decomposition of complex jobs into tasks that must be scheduled on distributed processing nodes. There are various ways of creating...
Heath A. James, Kenneth A. Hawick
ICS
1998
Tsinghua U.
15 years 7 months ago
Load Execution Latency Reduction
In order to achieve high performance, contemporary microprocessors must effectively process the four major instruction types: ALU, branch, load, and store instructions. This paper...
Bryan Black, Brian Mueller, Stephanie Postal, Ryan...
ASPLOS
1996
ACM
15 years 7 months ago
An Integrated Compile-Time/Run-Time Software Distributed Shared Memory System
On a distributed memory machine, hand-coded message passing leads to the most efficient execution, but it is difficult to use. Parallelizing compilers can approach the performance...
Sandhya Dwarkadas, Alan L. Cox, Willy Zwaenepoel
GRID
2007
Springer
15 years 7 months ago
Global-scale peer-to-peer file services with DFS
The global inter-networking infrastructure that has become essential for contemporary day-to-day computing and communication tasks, has also enabled the deployment of several large...
Antony Chazapis, Georgios Tsoukalas, Georgios Veri...
148
Voted
CCGRID
2006
IEEE
15 years 7 months ago
A Feedback Mechanism for Network Scheduling in LambdaGrids
Next-generation e-Science applications will require the ability to transfer information at high data rates between distributed computing centers and data repositories. A LambdaGri...
Pallab Datta, Sushant Sharma, Wu-chun Feng