Sciweavers

209 search results - page 11 / 42
» Fault-Tolerant Scheduling on a Hard Real-Time Multiprocessor...
Sort
View
RTDB
1997
75views more  RTDB 1997»
14 years 8 days ago
Implementing Hard Real-Time Transactions on Multiprocessors
We present a new approach to implementing real-time transactions on memory-resident data on sharedmemory multiprocessors. This approach allows hard deadlines to be supported witho...
James H. Anderson, Rohit Jain, Srikanth Ramamurthy
DAC
1999
ACM
14 years 3 months ago
Power Conscious Fixed Priority Scheduling for Hard Real-Time Systems
Power efficient design of real-time systems based on programmable processors becomes more important as system functionality is increasingly realized through software. This paper ...
Youngsoo Shin, Kiyoung Choi
TPDS
1998
125views more  TPDS 1998»
13 years 10 months ago
An Efficient Dynamic Scheduling Algorithm For Multiprocessor Real-Time Systems
—Many time-critical applications require predictable performance and tasks in these applications have deadlines to be met. In this paper, we propose an efficient algorithm for no...
G. Manimaran, C. Siva Ram Murthy
ASPDAC
2007
ACM
174views Hardware» more  ASPDAC 2007»
14 years 2 months ago
Energy-Efficient Real-Time Task Scheduling in Multiprocessor DVS Systems
Dynamic voltage scaling (DVS) circuits have been widely adopted in many computing systems to provide tradeoff between performance and power consumption. The effective use of energ...
Jian-Jia Chen, Chuan-Yue Yang, Tei-Wei Kuo, Chi-Sh...
RTCSA
2007
IEEE
14 years 5 months ago
Real-Time Scheduling with Task Splitting on Multiprocessors
This paper presents a real-time scheduling algorithm with high schedulability and few preemptions for multiprocessor systems. The algorithm is based on an unorthodox method called...
Shinpei Kato, Nobuyuki Yamasaki