1257 search results - page 31 / 252 » Near-Optimal Scheduling of Distributed Algorithms |
IEEEPACT
1998
IEEE
15 years 4 months ago
1998
IEEE
Compile-time scheduling is one approach to extract parallelism which has proved effective when the execution behavior is predictable. Unfortunately, the performance of most priori...
RTCSA
2008
IEEE
15 years 6 months ago
2008
IEEE
Cache partitioning techniques have been proposed in the past as a solution for the cache interference problem. Due to qualitative differences with general purpose platforms, real-...
TSP
2008
14 years 11 months ago
2008
A space-time optimal power schedule for multiple distributed multiple-input multiple-output (MIMO) links without the knowledge of the instantaneous channel state information at th...
FCS
2008
15 years 1 months ago
2008
Abstract. Autonomous scheduling deals with the problem - how to enable agents to schedule a set of interdependent tasks in such a way that whatever schedule they choose for their t...
IPPS
2000
IEEE
15 years 4 months ago
2000
IEEE
In a machine that follows the dynamically trace scheduled VLIW (DTSVLIW) architecture, VLIW instructions are built dynamically through an algorithm that can be implemented in hard...