Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,398,570 papers from all fields of science
Search
Sign In
Create Free Account
Rate-monotonic scheduling
Known as:
RMS
, Rate Monotonic Scheduling
In computer science, rate-monotonic scheduling (RMS) is a scheduling algorithm used in real-time operating systems (RTOS) with a static-priority…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
23 relations
Busy waiting
Central processing unit
Computer hardware
Computer science
Expand
Broader (1)
Real-time computing
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Rate-Harmonized Scheduling and Its Applicability to Energy Management
Anthony G. Rowe
,
Karthik Lakshmanan
,
Haifeng Zhu
,
R. Rajkumar
IEEE Transactions on Industrial Informatics
2010
Corpus ID: 18708482
This paper presents a family of Rate-Harmonized Schedulers that can be used in reservation-based operating systems to naturally…
Expand
2009
2009
The utilization bound of non-preemptive rate-monotonic scheduling in Controller Area Networks is 25%
Björn Andersson
,
E. Tovar
IEEE International Symposium on Industrial…
2009
Corpus ID: 15887370
Consider a distributed computer system comprising many computer nodes, each interconnected with a Controller Area Network (CAN…
Expand
2008
2008
Global Rate-Monotonic Scheduling with Priority Promotion
Shinpei Kato
,
Akira Takeda
,
N. Yamasaki
2008
Corpus ID: 13383134
In this paper, we consider a multicore real-time scheduling algorithm incorporating benefits of both fixed-priority and dynamic…
Expand
Highly Cited
2004
Highly Cited
2004
Minimum and maximum utilization bounds for multiprocessor rate monotonic scheduling
J. López
,
J. L. Díaz
,
D. F. García
IEEE Transactions on Parallel and Distributed…
2004
Corpus ID: 825704
The utilization bound for real-time rate monotonic (RM) scheduling on uniprocessors is extended to multiprocessors with…
Expand
2002
2002
Imprecise computation fault-tolerant rate-monotonic scheduling
Yu Chen
,
Guang-ze Xiong
Fifth International Conference on Algorithms and…
2002
Corpus ID: 18574609
Fault-tolerant real-time scheduling is a hot topic in dependable real-time system research. We combine the FT-RM with imprecise…
Expand
2002
2002
The aperiodic multiprocessor utilization bound for liquid tasks
T. Abdelzaher
,
Björn Andersson
,
Jan Jonsson
,
V. Sharma
,
Minh Q. Nguyen
Proceedings. Eighth IEEE Real-Time and Embedded…
2002
Corpus ID: 1205633
Real-time scheduling theory has developed powerful tools for translating conditions on aggregate system utilization into per-task…
Expand
2001
2001
Multiplicative Updates for Classification by Mixture Models
L. Saul
,
Daniel D. Lee
Neural Information Processing Systems
2001
Corpus ID: 7993922
We investigate a learning algorithm for the classification of nonnegative data by mixture models. Multiplicative update rules are…
Expand
1998
1998
The Statistical Rate Monotonic Scheduling Workbench
Alia Atlas
,
Azer Bestavros
1998
Corpus ID: 63818836
Abstract The SRMS Workbench is a software system developed to demonstrate the notion of Statistical QoS employed in SRMS…
Expand
1997
1997
Incremental rate monotonic scheduling for improved control system performance
P. Binns
Proceedings Third IEEE Real-Time Technology and…
1997
Corpus ID: 36718497
The paper presents an algorithm and its run-time performance for scheduling periodic incremental and design-to-time processes…
Expand
1994
1994
Enhancing fault-tolerance in rate-monotonic scheduling
Y. Oh
,
S. Son
Real-time systems
1994
Corpus ID: 23658216
In this paper, we address the problem of supporting timeliness and dependability at the level of task scheduling. We consider the…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE