Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

SODA
2000
ACM

favoriteEmaildiscussreport

76views Algorithms» more SODA 2000»

Scheduling to minimize average stretch without migration

13 years 5 months ago

Scheduling to minimize average stretch without migration

Download www.dis.uniroma1.it

Luca Becchetti, Stefano Leonardi, S. Muthukrishnan

Real-time Traffic

Algorithms | SODA 2000 |

claim paper

Related Content

» Combinatorial Algorithms for Data Migration to Minimize Average Completion Time

» Simultaneous Power Fluctuation and Average Power Minimization during NanoCMOS Behavioral S...

» Loop scheduling for minimizing schedule length and switching activities

» NonClairvoyant Scheduling for Minimizing Mean Slowdown

» Online Scheduling with Bounded Migration

» ACM An Efficient Approach for Managing Shared Caches in Chip Multiprocessors

» Accuracy versus Migration Overhead in RealTime Multiprocessor Reweighting Algorithms

» Failure Rate Minimization with Multiple Function Unit Scheduling for Heterogeneous WSNs

» Energy minimization with loop fusion and multifunctionalunit scheduling for multidimension...

Post Info
More Details (n/a)

Added	01 Nov 2010
Updated	01 Nov 2010
Type	Conference
Year	2000
Where	SODA
Authors	Luca Becchetti, Stefano Leonardi, S. Muthukrishnan

Comments (0)