{3} H. Chetto and M. Chetto, "On the acceptation of non-periodic time critical tasks indistributed systems," in Proc. 7th IFAC Workshop Distribteted Computer Control Sytems (DCCS-86) , Maychoss, West Germany, Oct. 30-Sept. 2, 1986.

Google Scholar

[4]

{4} H. Chetto and M. Chetto, "How to insure feasibility in a distributed system for real time control," in High Performance Computer Systems , E. Gelenbe, Eds. Amsterdam, The Netherlands: North-Holland.

Google Scholar

[5]

{5} M. R. Garey and D. S. Johnson, Computers and Intractability. A Guide to the Theory of NP-Completeness . San Francisco, CA: Freeman, 1979.

Digital Library

Google Scholar

[6]

{6} M. J. Gonzalez, Jr., "Deterministic processor scheduling," ACM Comput. Surveys , vol. 9, no. 3, pp. 173-203, Sept. 1977.

Digital Library

Google Scholar

[7]

{7} H. Hecht, "Fault tolerant software for real-time applications," ACM Comput. Surveys , vol. 8, no. 4, pp. 391-407, 1976.

Digital Library

Google Scholar

[8]

{8} W. Horn, "Some simple scheduling algorithms," Naval Res. Logist. Quart. vol. 21, pp. 177-185, 1974.

Crossref

Google Scholar

[9]

{9} C. M. Krishna and K. G. Shin. "On scheduling tasks with a quick recovery from failure," IEEE Trans. Comput. , vol. C-35, no. 5, pp. 448-455, May 1986.

Digital Library

Google Scholar

[10]

{10} J. Labetoulle, "Some theorems on real time scheduling," in Computer Architectures and Networks , E. Gelenbe and R. Mahl, Eds. Amsterdam, The Netherlands: North-Holland, pp. 285-298.

Google Scholar

[11]

{11} E. L. Lawler and C. U. Martel, "Scheduling periodically occurring tasks on multiple processors," Inform. Processing Lett. , vol. 12, no. 1, pp. 9-12, Feb. 1981.

Crossref

Google Scholar

[12]

{12} J. Y. T. Leung, and M. L. Merril, "A note on preemptive scheduling of periodic real-time tasks," Inform. Processing Lett. , vol. 20, no. 3, pp. 115-118, 1980.

Crossref

Google Scholar

[13]

{13} A. L. Liestman and R. H. Campbell, "A fault-tolerant scheduling problem," IEEE Trans. Software Eng. , vol. SE-12, no. 11, pp. 1089- 1095, Nov. 1986.

Digital Library

Google Scholar

[14]

{14} C. L. Liu and J. W. Layland, "Scheduling algorithms for multiprogramming in a hard real-lime environment," J. ACM , vol. 20, no. 1, pp. 46-61, 1973.

Digital Library

Google Scholar

[15]

{15} K. Ramamritham and J. Stankovic, "Dynamic task scheduling in hard real-time distributed systems," IEEE Software , vol. 1, no. 3, pp. 65- 75, July 1984.

Digital Library

Google Scholar

[16]

{16} B. Randell, P. A. Lee, and P. C. Treleaven, "Reliability issues in computing system design," ACM Comput. Surveys , vol. 10, no. 2, pp. 123-165, 1978.

Digital Library

Google Scholar

[17]

{17} O. Serlin, "Scheduling of time critical processes," in Proc. Spring Joint Computer Conf. , 1972, pp. 925-932.

Google Scholar

[18]

{18} A. Y. Wei, K. Hiraishi, R. Cheng, and R. H. Campbell, "Application of the fault-tolerant deadline mechanism to a satellite on-board computer system," in Proc. FTCS-10 , 1980, pp. 107-109.

Google Scholar

[19]

{19} W. Zhao and K. Ramamritham. "Distributed scheduling using bidding and focussed addressing," in Proc. Real-Time Systems Symp. , San Diego, CA, Dec. 3-6, 1985, pp. 112-122.

Google Scholar

Cited By

View all

Niu LRawat DMusselwhite JGu ZDeng Q(2024)Energy-Constrained Scheduling for Weakly Hard Real-Time Systems Using Standby-SparingACM Transactions on Design Automation of Electronic Systems10.1145/363158729:2(1-35)Online publication date: 15-Feb-2024
https://dl.acm.org/doi/10.1145/3631587
Yang SLiu JArpaci-Dusseau AArpaci-Dusseau R(2023)Principled Schedulability Analysis for Distributed Storage Systems Using Thread Architecture ModelsACM Transactions on Storage10.1145/357432319:2(1-47)Online publication date: 6-Mar-2023
https://dl.acm.org/doi/10.1145/3574323
Sahoo AGao WRopitault TGolmie N(2023)Admission Control and Scheduling of Isochronous Traffic With Guard Time in IEEE 802.11ad MACIEEE Transactions on Mobile Computing10.1109/TMC.2022.320796922:12(7218-7233)Online publication date: 1-Dec-2023
https://dl.acm.org/doi/10.1109/TMC.2022.3207969
Show More Cited By

Index Terms

Recommendations

Job vs. portioned partitioning for the earliest deadline first semi-partitioned scheduling

In this paper, we focus on the semi-partitioned scheduling of sporadic tasks with constrained deadlines and identical processors. We study two cases of semi-partitioning: (i) the case where the worst case execution time (WCET) of a job can be portioned, ...
Exact speedup factors and sub-optimality for non-preemptive scheduling

Fixed priority scheduling is used in many real-time systems; however, both preemptive and non-preemptive variants (FP-P and FP-NP) are known to be sub-optimal when compared to an optimal uniprocessor scheduling algorithm such as preemptive earliest ...
Minimizing Total Completion Time on Parallel Machines with Deadline Constraints

Consider n independent jobs and m identical machines in parallel. Job j has a processing time p_j and a deadline $\bar{d}_j$. It must complete its processing before or at its deadline. All jobs are available for processing at time t=0 and preemptions are ...

Comments

Information & Contributors

Information

Published In

cover image IEEE Transactions on Software Engineering

IEEE Transactions on Software Engineering Volume 15, Issue 10

October 1989

182 pages

ISSN:0098-5589

Editor:
Victor R. Basili
Univ. of Maryland, College Point

Issue’s Table of Contents

Publisher

IEEE Press

Publication History

Published: 01 October 1989

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

75
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 04 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Niu LRawat DMusselwhite JGu ZDeng Q(2024)Energy-Constrained Scheduling for Weakly Hard Real-Time Systems Using Standby-SparingACM Transactions on Design Automation of Electronic Systems10.1145/363158729:2(1-35)Online publication date: 15-Feb-2024
https://dl.acm.org/doi/10.1145/3631587
Yang SLiu JArpaci-Dusseau AArpaci-Dusseau R(2023)Principled Schedulability Analysis for Distributed Storage Systems Using Thread Architecture ModelsACM Transactions on Storage10.1145/357432319:2(1-47)Online publication date: 6-Mar-2023
https://dl.acm.org/doi/10.1145/3574323
Sahoo AGao WRopitault TGolmie N(2023)Admission Control and Scheduling of Isochronous Traffic With Guard Time in IEEE 802.11ad MACIEEE Transactions on Mobile Computing10.1109/TMC.2022.320796922:12(7218-7233)Online publication date: 1-Dec-2023
https://dl.acm.org/doi/10.1109/TMC.2022.3207969
Anthony BChung CDas AYuen D(2023)Earliest Deadline First Is a 2-Approximation for DARP with Time WindowsCombinatorial Optimization and Applications10.1007/978-3-031-49614-1_6(97-110)Online publication date: 15-Dec-2023
https://dl.acm.org/doi/10.1007/978-3-031-49614-1_6
Sahoo AGao WRopitault TGolmie NIgartua MGiannelli CZheng J(2021)Admission Control and Scheduling of Isochronous Traffic in IEEE 802.11ad MACProceedings of the 24th International ACM Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems10.1145/3479239.3485698(125-134)Online publication date: 22-Nov-2021
https://dl.acm.org/doi/10.1145/3479239.3485698
Li RYu HJiang WHa YLi Z(2020)DVFS-based scrubbing scheduling for reliability maximization on parallel tasks in SRAM-based FPGAsProceedings of the 57th ACM/EDAC/IEEE Design Automation Conference10.5555/3437539.3437677(1-6)Online publication date: 20-Jul-2020
https://dl.acm.org/doi/10.5555/3437539.3437677
El Ghor HAggoune E(2020)Energy efficient scheduler of aperiodic jobs for real-time embedded systemsInternational Journal of Automation and Computing10.1007/s11633-016-0993-317:5(733-743)Online publication date: 1-Oct-2020
https://dl.acm.org/doi/10.1007/s11633-016-0993-3
Difallah DChecco ADemartini GCudré-Mauroux P(2019)Deadline-Aware Fair Scheduling for Multi-Tenant Crowd-Powered SystemsACM Transactions on Social Computing10.1145/33010032:1(1-29)Online publication date: 21-Feb-2019
https://dl.acm.org/doi/10.1145/3301003
El Ghor HChetto M(2019)Energy Guarantee Scheme for Real-time Systems with Energy Harvesting ConstraintsInternational Journal of Automation and Computing10.1007/s11633-018-1166-316:3(354-368)Online publication date: 1-Jun-2019
https://dl.acm.org/doi/10.1007/s11633-018-1166-3
Domínguez CMartínez JBusquets-Mataix JHassan H(2019)Human---computer cooperation platform for developing real-time robotic applicationsThe Journal of Supercomputing10.1007/s11227-018-2343-475:4(1849-1868)Online publication date: 1-Apr-2019
https://dl.acm.org/doi/10.1007/s11227-018-2343-4
Show More Cited By

Abstract

References

Cited By

Index Terms

Recommendations

Job vs. portioned partitioning for the earliest deadline first semi-partitioned scheduling

Exact speedup factors and sub-optimality for non-preemptive scheduling

Minimizing Total Completion Time on Parallel Machines with Deadline Constraints

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations