Sciweavers

2110 search results - page 377 / 422
» What is the complexity of a distributed computing system
Sort
View
SKG
2005
IEEE
15 years 9 months ago
A Heuristic Algorithm for Task Scheduling Based on Mean Load
Efficient task scheduling is critical to achieving high performance on grid computing environment. A heuristic task scheduling algorithm satisfied resources load balancing on grid ...
Lina Ni, Jinquan Zhang, ChunGang Yan, Changjun Jia...
ICS
2005
Tsinghua U.
15 years 9 months ago
A NUCA substrate for flexible CMP cache sharing
We propose an organization for the on-chip memory system of a chip multiprocessor, in which 16 processors share a 16MB pool of 256 L2 cache banks. The L2 cache is organized as a n...
Jaehyuk Huh, Changkyu Kim, Hazim Shafi, Lixin Zhan...
112
Voted
EUROPAR
2009
Springer
15 years 8 months ago
Capturing and Visualizing Event Flow Graphs of MPI Applications
A high-level understanding of how an application executes and which performance characteristics it exhibits is essential in many areas of high performance computing, such as applic...
Karl Fürlinger, David Skinner
SAC
2000
ACM
15 years 8 months ago
WCML: Paving the Way for Reuse in Object-Oriented Web Engineering
Since 1990 the Web has changed from a distributed hypertext system to an efficient environment for application delivery. Due to the legacy of the Web implementation model the deve...
Martin Gaedke, Christian Segor, Hans-Werner Geller...
126
Voted
ATAL
2008
Springer
15 years 6 months ago
Automated design of scoring rules by learning from examples
Scoring rules are a broad and concisely-representable class of voting rules which includes, for example, Plurality and Borda. Our main result asserts that the class of scoring rul...
Ariel D. Procaccia, Aviv Zohar, Jeffrey S. Rosensc...