Sciweavers

4797 search results - page 7 / 960
» The complexity of partition tasks
Sort
View
ECRTS
2006
IEEE
14 years 1 months ago
The Partitioned Scheduling of Sporadic Tasks According to Static-Priorities
A polynomial-time algorithm is presented for partitioning a collection of sporadic tasks among the processors of an identical multiprocessor platform with static-priority scheduli...
Nathan Fisher, Sanjoy K. Baruah, Theodore P. Baker
PERVASIVE
2005
Springer
14 years 1 months ago
Task Partitioning in Smart Environments
This paper studies the use of a Bluetooth enabled mobile phone as a controlling device in a smart environment. Main focus for the work is partitioning of the functionality and the...
Markus Ritala, Jukka Vanhala
RTCSA
2000
IEEE
13 years 12 months ago
Fixed-priority preemptive multiprocessor scheduling: to partition or not to partition
Traditional multiprocessor real-time scheduling partitions a task set and applies uniprocessor scheduling on each processor. By allowing a task to resume on another processor than...
Björn Andersson, Jan Jonsson
CEC
2009
IEEE
14 years 2 months ago
Task decomposition and evolvability in intrinsic evolvable hardware
— Many researchers have encountered the problem that the evolution of electronic circuits becomes exponentially more difficult when problems with an increasing number of outputs...
Tüze Kuyucu, Martin Trefzer, Julian Francis M...