Algorithms for Dynamic Speed Scaling ∗

First Page		Document Content
Date: 2011-03-11 05:00:42 Mathematics Applied mathematics Mathematical optimization Scheduling Analysis of algorithms Job shop scheduling Online algorithm Algorithm Multiprocessor scheduling Operations research Concurrent computing Scheduling algorithms		Algorithms for Dynamic Speed Scaling ∗ Add to Reading List Source URL: subs.emis.de Download Document from Source Website File Size: 530,75 KB Share Document on Facebook

	Fixed-Priority Multiprocessor Scheduling: Beyond Liu & Layland Utilization Bound Nan Guan1 , Martin Stigge1 , Wang Yi1 and Ge Yu2 1 Uppsala University, Sweden 2 Northeastern University, China DocID: 1v0Mp - View Document
	Towards the Optimal Solution of the Multiprocessor Scheduling Problem with Communication Delays Tatjana Davidovi´c Mathematical Institute, Serbian Academy of Sciences, Belgrade, Serbia, Leo Liberti DocID: 1u2Jz - View Document
	Fixed-Priority Multiprocessor Scheduling with Liu & Layland’s Utilization Bound Nan Guan†‡ , Martin Stigge† , Wang Yi†‡ and Ge Yu‡ † Department ‡ Department of Information Technology, Uppsala Universit DocID: 1u2AO - View Document
	Partitioned Mixed-Criticality Scheduling on Multiprocessor Platforms DocID: 1tUUZ - View Document
	Simulation-Based Evaluations of DAG Scheduling in Hard Real-time Multiprocessor Systems Manar Qamhieh, Serge Midonnet To cite this version: Manar Qamhieh, Serge Midonnet. Simulation-Based Evaluations of DAG Scheduling in DocID: 1t7oJ - View Document