1257 search results - page 187 / 252 » Near-Optimal Scheduling of Distributed Algorithms |
IRREGULAR
1995
Springer
15 years 1 months ago
1995
Springer
Dependencies between iterations of loop structures cannot always be determined at compile-time because they may depend on input data which is known only at run-time. A prime examp...
IPPS
2007
IEEE
15 years 4 months ago
2007
IEEE
The growing complexity of modern processors has made the development of highly efficient code increasingly difficult. Manually developing highly efficient code is usually expen...
112
click to vote
ATAL
2008
Springer
14 years 12 months ago
2008
Springer
Computational grids offer users a simple access to tremendous computer resources for solving large scale computing problems. Traditional performance analysis of scheduling algorit...
IEEEPACT
2000
IEEE
15 years 2 months ago
2000
IEEE
Dynamic Optimization is an umbrella term that refers to any optimization of software that is performed after the initial compile time. It is a complementary optimization opportuni...
PPAM
2005
Springer
15 years 3 months ago
2005
Springer
We present a web computing library (PUBWCL) in Java that allows to execute tightly coupled, massively parallel algorithms in the bulk-synchronous (BSP) style on PCs distributed ove...