1257 search results - page 130 / 252 » Near-Optimal Scheduling of Distributed Algorithms |
109
click to vote
CIA
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. In this paper we investigate methods for analyzing the expected value of adding information in distributed task scheduling problems. As scheduling problems are NP-complet...
103
click to vote
IPPS
1998
IEEE
15 years 6 months ago
1998
IEEE
Instruction scheduling methods based on the construction of state diagrams (or automata) have been used for architectures involving deeply pipelined function units. However, the s...
144
click to vote
GECCO
2008
Springer
15 years 2 months ago
2008
Springer
The main purpose of this paper is to propose a Multi-Agent Autonomic and Bio-Inspired based framework with selfmanaging capabilities to solve complex scheduling problems using coo...
105
click to vote
IPPS
2008
IEEE
15 years 8 months ago
2008
IEEE
High-performance microprocessors, e.g., multithreaded and multicore processors, are being implemented in embedded real-time systems because of the increasing computational require...
131
click to vote
HPDC
2005
IEEE
15 years 7 months ago
2005
IEEE
Applications that use parallel TCP streams to increase throughput must multiplex and demultiplex data blocks over a set of TCP streams transmitting on one or more network paths. W...