34 search results - page 3 / 7 » Performance comparison of several priority schemes with prio... |
JPDC
2007
13 years 8 months ago
2007
Achieving high performance for concurrent applications on modern multiprocessors remains challenging. Many programmers avoid locking to improve performance, while others replace l...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
In this paper we study the partitioning approach for multiprocessor real-time scheduling. This approach seems to be the easiest since, once the partitioning of the task set has be...
IPPS
2006
IEEE
14 years 2 months ago
2006
IEEE
Achieving high performance for concurrent applications on modern multiprocessors remains challenging. Many programmers avoid locking to improve performance, while others replace l...
APCSAC
2004
IEEE
14 years 5 days ago
2004
IEEE
Abstract. While the fetch unit has been identified as one of the major bottlenecks of Simultaneous Multithreading architecture, several fetch schemes were proposed by prior works t...
FTDCS
1999
IEEE
14 years 21 days ago
1999
IEEE
This paper addresses issues of task clustering-the coalition of several fine grain tasks into single coarser grain tasks called task clusters+md task cluster scheduling on distrib...