459 search results - page 68 / 92 » Using Kernel Couplings to Predict Parallel Application Perfo... |
105
click to vote
ICDCS
1991
IEEE
15 years 6 months ago
1991
IEEE
of ‘‘network computers’’ is inherently lessAbstract predictable than that of more traditional distributed memory systems, such as hypercubes [22], since both theFor computa...
170
click to vote
PPOPP
2011
ACM
14 years 5 months ago
2011
ACM
In recent years, GPUs have emerged as an extremely cost-effective means for achieving high performance. Many application developers, including those with no prior parallel program...
103
click to vote
HPDC
2006
IEEE
15 years 8 months ago
2006
IEEE
Most parallel computing resources are controlled by batch schedulers that place requests for computation in a queue until access to compute nodes is granted. Queue waiting times a...
146
Voted
TPDS
1998
15 years 2 months ago
1998
—Many time-critical applications require predictable performance and tasks in these applications have deadlines to be met. In this paper, we propose an efficient algorithm for no...
128
click to vote
IPPS
2003
IEEE
15 years 7 months ago
2003
IEEE
The application of hardware-parameterized models to distributed systems can result in omission of key bottlenecks such as the full cost of inter-node communication in a shared mem...