Sciweavers

66 search results - page 11 / 14
» Optimal Scheduling Algorithms for Input-Queued Switches
Sort
View
87
Voted
IPPS
2009
IEEE
15 years 4 months ago
Minimizing total busy time in parallel scheduling with application to optical networks
—We consider a scheduling problem in which a bounded number of jobs can be processed simultaneously by a single machine. The input is a set of n jobs J = {J1, . . . , Jn}. Each j...
Michele Flammini, Gianpiero Monaco, Luca Moscardel...
FOCS
1997
IEEE
15 years 1 months ago
General Dynamic Routing with Per-Packet Delay Guarantees of O(distance + 1 / session rate)
A central issue in the design of modern communication networks is that of providing performance guarantees. This issue is particularly important if the networks support real-time t...
Matthew Andrews, Antonio Fernández, Mor Har...
COMCOM
2006
150views more  COMCOM 2006»
14 years 9 months ago
Adaptive ad hoc self-organizing scheduling for quasi-periodic sensor network lifetime
Wireless sensor networks are poised to revolutionize our abilities in sensing and controlling our environment. Power conservation is a primary research concern for these networks....
Sharat C. Visweswara, Rudra Dutta, Mihail L. Sichi...
79
Voted
PDPTA
2004
14 years 11 months ago
Design of a Real-Time Scheduler for Kahn Process Networks on Multiprocessor Systems
High-throughput real-time systems require non-standard and costly hardware and software solutions. Modern workstation can represent a credible alternative to develop realtime inte...
Javed Dulloo, Philippe Marquet
93
Voted
ICCAD
1995
IEEE
135views Hardware» more  ICCAD 1995»
15 years 1 months ago
An iterative improvement algorithm for low power data path synthesis
We address the problem of minimizing power consumption in behavioral synthesis of data-dominated circuits. The complex nature of power as a cost function implies that the effects ...
Anand Raghunathan, Niraj K. Jha