5448 search results - page 207 / 1090 » Breakpoints and Time in Distributed Computations |
120
click to vote
ICS
2010
Tsinghua U.
15 years 9 months ago
2010
Tsinghua U.
We present a new cache oblivious scheme for iterative stencil computations that performs beyond system bandwidth limitations as though gigabytes of data could reside in an enormou...
144
click to vote
IPPS
1997
IEEE
15 years 8 months ago
1997
IEEE
Abstract. The incremental and dynamic construction of interconnection networks from smaller components often leaves the fundamental problem of assigning addresses to processors to ...
180
click to vote
JSSPP
1995
Springer
15 years 8 months ago
1995
Springer
We describe a scheduler based on the microeconomic paradigm for scheduling on-line a set of parallel jobs in a multiprocessor system. In addition to increasing the system throughpu...
150
click to vote
ATAL
2008
Springer
15 years 6 months ago
2008
Springer
This work presents a best-first anytime algorithm for computing optimal coalition structures. The approach is novel in that it generates coalition structures based on coalition va...
159
click to vote
GLOBECOM
2008
IEEE
15 years 5 months ago
2008
IEEE
Abstract— An important issue for supporting multimedia applications in multiple heterogeneous networks, a typical pervasive computing environment, is how to optimize the rate all...