An Efficient Execution Framework of Two-Part Execution Scenario Analysis
Abstract
References
Index Terms
- An Efficient Execution Framework of Two-Part Execution Scenario Analysis
Recommendations
Schedulability Analysis of Tasks with Corunner-Dependent Execution Times
Consider fixed-priority preemptive partitioned scheduling of constrained-deadline sporadic tasks on a multiprocessor. A task generates a sequence of jobs and each job has a deadline that must be met. Assume tasks have Corunner-dependent execution times; ...
Unit Execution Time Shop Problems
The problem of preemptively and nonpreemptively scheduling a set of n independent jobs on an m machine open shop, flow shop or job shop is studied. It is shown that the problem of constructing optimal mean finishing time preemptive and nonpreemptive ...
LLF Schedulability Analysis on Multiprocessor Platforms
RTSS '10: Proceedings of the 2010 31st IEEE Real-Time Systems SymposiumLLF (Least Laxity First) scheduling, which assigns a higher priority to a task with smaller laxity, has been known as an optimal preemptive scheduling algorithm on a single processor platform. However, its characteristics upon multiprocessor platforms ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Publisher
Association for Computing Machinery
New York, NY, United States
Journal Family
Publication History
Check for updates
Author Tags
Qualifiers
- Research-article
- Refereed
Funding Sources
- State Key Program of National Natural Science of China
- National Natural Science Foundation of China
- Natural Science Foundation of Hubei Province, China
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 394Total Downloads
- Downloads (Last 12 months)129
- Downloads (Last 6 weeks)27
Other Metrics
Citations
View Options
View options
View or Download as a PDF file.
PDFeReader
View online with eReader.
eReaderHTML Format
View this article in HTML Format.
HTML FormatLogin options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in