1053 search results - page 132 / 211 » Estimating Execution Time of Distributed Applications |
135
click to vote
ISPASS
2009
IEEE
2009
IEEE
Machine learning based online performance prediction for runtime parallelization and task scheduling
15 years 10 months ago
—With the emerging many-core paradigm, parallel programming must extend beyond its traditional realm of scientific applications. Converting existing sequential applications as w...
115
click to vote
SIGMETRICS
2009
ACM
15 years 9 months ago
2009
ACM
We present a system for allocating resources in shared data and compute clusters that improves MapReduce job scheduling in three ways. First, the system uses regulated and user-as...
116
click to vote
ICPP
2005
IEEE
15 years 8 months ago
2005
IEEE
We consider the filter decomposition problem in supporting coarse-grained pipelined parallelism. This form of parallelism is suitable for data-driven applications in scenarios wh...
105
click to vote
ICPPW
2005
IEEE
15 years 8 months ago
2005
IEEE
Large–scale parallel applications performing global synchronization may spend a significant amount of execution time waiting for the completion of a barrier operation. Conseque...
107
click to vote
PADS
2003
ACM
15 years 8 months ago
2003
ACM
This paper presents Maya, a multi-paradigm, scalable and extensible network modeling framework for emulating distributed applications. A novel three-tier architecture is proposed ...