Sciweavers

7065 search results - page 1180 / 1413
» Iterative Scheduling Algorithms
Sort
View
RSP
1999
IEEE
128views Control Systems» more  RSP 1999»
15 years 10 months ago
3-D Floorplanning: Simulated Annealing and Greedy Placement Methods for Reconfigurable Computing Systems
The advances in the programmable hardware has lead to new architectures where the hardware can be dynamically adapted to the application to gain better performance. There are stil...
Kia Bazargan, Ryan Kastner, Majid Sarrafzadeh
HPDC
1998
IEEE
15 years 10 months ago
Matchmaking: Distributed Resource Management for High Throughput Computing
Conventional resource management systems use a system model to describe resources and a centralized scheduler to control their allocation. We argue that this paradigm does not ada...
Rajesh Raman, Miron Livny, Marvin H. Solomon
RSP
1998
IEEE
188views Control Systems» more  RSP 1998»
15 years 10 months ago
Performance and Interface Buffer Size Driven Behavioral Partitioning for Embedded Systems
One of the major differences in partitioning for codesign is in the way the communication cost is evaluated. Generally the size of the edge cut-set is used. When communication bet...
T.-C. Lin, Sadiq M. Sait, Walling R. Cyre
145
Voted
STOC
1998
ACM
108views Algorithms» more  STOC 1998»
15 years 10 months ago
On Indexed Data Broadcast
We consider the problem of efficient information retrieval in asymmetric communication environments where multiple clients with limited resources retrieve information from a power...
Sanjeev Khanna, Shiyu Zhou
ICC
1997
IEEE
158views Communications» more  ICC 1997»
15 years 10 months ago
The Priority Token Bank in a Network of Queues
This paper takes a known approach for scheduling and admission control in integrated services networks1 , the Priority Token Bank (PTB), whose mechanism and performance have been ...
Mark A. Lynn, Jon M. Peha
« Prev « First page 1180 / 1413 Last » Next »