Log in

Relevant bibliographies by topics / Deadline Scheduling

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

Academic literature on the topic 'Deadline Scheduling'

Author: Grafiati

Published: 11 December 2022

Last updated: 25 January 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Deadline Scheduling.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Deadline Scheduling"

1

Chapalkar*, Sandeep S., and Karibasappa K. "Relative Deadline Analysis in Multitasking RTS using RM & EDF Scheduling." International Journal of Recent Technology and Engineering 10, no. 1 (2021): 246–51. http://dx.doi.org/10.35940/ijrte.a5900.0510121.

Full text

Abstract:

In embedded systems the time required for any process to complete its execution in multitasking environment is an important factor to understand the performance of Real Time System (RTS) and its ability fulfill the deadline requirement of each process under different process load conditions. Even though some non-critical systems provide flexibility over deadlines, the hard real time systems are to be designed to meet the deadline requirement of all processes under peak process load condition. The number of processes available in scheduling queue may vary with time, the dynamic load on processi

APA, Harvard, Vancouver, ISO, and other styles

2

Chen, Xing, Umit Ogras, and Chaitali Chakrabarti. "Probabilistic Risk-Aware Scheduling with Deadline Constraint for Heterogeneous SoCs." ACM Transactions on Embedded Computing Systems 21, no. 2 (2022): 1–27. http://dx.doi.org/10.1145/3489409.

Full text

Abstract:

Hardware Trojans can compromise System-on-Chip (SoC) performance. Protection schemes implemented to combat these threats cannot guarantee 100% detection rate and may also introduce performance overhead. This paper defines the risk of running a job on an SoC as a function of the misdetection rate of the hardware Trojan detection methods implemented on the cores in the SoC. Given the user-defined deadlines of each job, our goal is to minimize the job-level risk as well as the deadline violation rate for both static and dynamic scheduling scenarios. We assume that there is no relationship between

APA, Harvard, Vancouver, ISO, and other styles

3

Che, Haiying, Xiaolong Wang, Hong Wang, Zixing Bai, and Honglei Li. "Scheduling with Deadline Constraint of Healthcare Applications on Cloud-Based Workflow." Journal of Medical Imaging and Health Informatics 10, no. 10 (2020): 2430–38. http://dx.doi.org/10.1166/jmihi.2020.3290.

Full text

Abstract:

Cloud-based workflow technology has played an important role in the development of large scale healthcare applications with high flexibility to meet variety of healthcare process requirements. Among all the factors affecting the healthcare applications on cloud-based workflow, the tasks scheduling is the crucial one. This paper aims at the cloud-based workflow tasks scheduling with deadline constraints and its implementation in two approaches: heuristic scheduling algorithm (HSA) and meta heuristic scheduling algorithm (HSA-ACO). HSA decomposes the workflow according to its structure and divid

APA, Harvard, Vancouver, ISO, and other styles

4

Audsley, N. C., A. Burns, M. F. Richardson, and A. J. Wellings. "Deadline Monotonic Scheduling Theory." IFAC Proceedings Volumes 25, no. 11 (1992): 55–60. http://dx.doi.org/10.1016/s1474-6670(17)50124-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Lam, Tak-Wah, Tsuen-Wan Johnny Ngan, Kar-Keung To, and Prudence Wai-Ha Wong. "Aggressive Online Deadline Scheduling." Electronic Notes in Theoretical Computer Science 91 (February 2004): 148–57. http://dx.doi.org/10.1016/j.entcs.2003.12.010.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

BEN ALLA, Said, Hicham BEN ALLA, Abdellah TOUHAFI, and Abdellah EZZATI. "An Efficient Energy-Aware Tasks Scheduling with Deadline-Constrained in Cloud Computing." Computers 8, no. 2 (2019): 46. http://dx.doi.org/10.3390/computers8020046.

Full text

Abstract:

Nowadays, Cloud Computing (CC) has emerged as a new paradigm for hosting and delivering services over the Internet. However, the wider deployment of Cloud and the rapid increase in the capacity, as well as the size of data centers, induces a tremendous rise in electricity consumption, escalating data center ownership costs and increasing carbon footprints. This expanding scale of data centers has made energy consumption an imperative issue. Besides, users’ requirements regarding execution time, deadline, QoS have become more sophisticated and demanding. These requirements often conflict with t

APA, Harvard, Vancouver, ISO, and other styles

7

Yan, Yanyang, Liang Yuan, and Yemei Li. "Research on Optimization of Production Decision Based on Payment Time and Price Coordination." Complexity 2020 (January 9, 2020): 1–9. http://dx.doi.org/10.1155/2020/2107582.

Full text

Abstract:

This paper focuses on the coordination and optimization between a manufacturer and multiple retailers in a supply chain. The manufacturer makes product quotes and delivery deadlines for all retailers, and each retailer selects product offers and delivery deadlines based on their own needs. Manufacturers maximize their own total profits by setting optimal quotes and delivery deadlines. This paper constructs the mathematical model of the optimal quotation and delivery deadline and proposes a scheduling algorithm that is different from the general M/M/1 and then studies the production scheduling

APA, Harvard, Vancouver, ISO, and other styles

8

Xu, Ling, Jianzhong Qiao, Shukuan Lin, and Wanting Zhang. "Dynamic Task Scheduling Algorithm with Deadline Constraint in Heterogeneous Volunteer Computing Platforms." Future Internet 11, no. 6 (2019): 121. http://dx.doi.org/10.3390/fi11060121.

Full text

Abstract:

Volunteer computing (VC) is a distributed computing paradigm, which provides unlimited computing resources in the form of donated idle resources for many large-scale scientific computing applications. Task scheduling is one of the most challenging problems in VC. Although, dynamic scheduling problem with deadline constraint has been extensively studied in prior studies in the heterogeneous system, such as cloud computing and clusters, these algorithms can’t be fully applied to VC. This is because volunteer nodes can get offline whenever they want without taking any responsibility, which is dif

APA, Harvard, Vancouver, ISO, and other styles

9

Ma, Zhi Yan, Zong Mei Tang, Guang You Yang, and Xu Wu Su. "CANbus Hybrid Scheduling Algorithm Based on DMS and EDF." Advanced Materials Research 787 (September 2013): 982–86. http://dx.doi.org/10.4028/www.scientific.net/amr.787.982.

Full text

Abstract:

By studying static scheduling algorithm Deadline Monotonous Scheduling (DMS) which assigns the priority fixedly to each message based on its deadline before starting the system and dynamic scheduling algorithm Earliest Deadline First (EDF) which assigns the priority dynamically based on its remaining deadline in the running time of system, combining the cheap CPU cost of DMS and high network utilization of EDF and using the layered structure, we presented a hybrid scheduling algorithm with considering critical level of messages. Based on the work mentioned above, the simulation platform of CAN

APA, Harvard, Vancouver, ISO, and other styles

10

Zhai, Yan Feng, and Feng Xiang Zhang. "A Review of Sufficient Schedulability Analysis for Fixed Priority Scheduling Systems." Applied Mechanics and Materials 741 (March 2015): 856–59. http://dx.doi.org/10.4028/www.scientific.net/amm.741.856.

Full text

Abstract:

This papercarries out a survey of sufficient schedulability analysis forfixed priority (FP) scheduling. The most common used fixed priority assignment is the rate monotonic (RM) algorithm, according to its policy, the task priorities are ordered based on their activation rates, so that the task with the shortest period is assigned the highest priority. However, when each task’s relative deadline is not equal to its period, the RM algorithm is not suitable to assign the task priorities. When relative deadlines are less than or equal to periods,the deadline monotonic (DM) algorithm can be deploy

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Deadline Scheduling"

1

Mak, Kin-sum. "Energy efficient online deadline scheduling." Click to view the E-thesis via HKUTO, 2007. http://sunzi.lib.hku.hk/HKUTO/record/B39558277.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

麥健心 and Kin-sum Mak. "Energy efficient online deadline scheduling." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2007. http://hub.hku.hk/bib/B39558277.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Wilson, Daniel. "Incorporating deadline scheduling into DCCP." Thesis, Wilson, Daniel (2013) Incorporating deadline scheduling into DCCP. PhD thesis, Murdoch University, 2013. https://researchrepository.murdoch.edu.au/id/eprint/18963/.

Full text

Abstract:

In current TCP, UDP and DCCP networks, the finite nature of real time data is not taken into consideration when scheduling of packets occurs on intermediate devices. To overcome this, the research presented in this thesis incorporates deadline scheduling into DCCP. This allows packet age information to be transferred by the DCCP protocol which provides intermediate devices with the ability to make more informed transportation decisions for real time data. By embedding two variables, in the form of options into DCCP-Data packets, a number of new prioritization and scheduling mechanisms that uti

APA, Harvard, Vancouver, ISO, and other styles

4

Aldarmi, Saud Ahmed. "Scheduling soft-deadline real-time transactions." Thesis, University of York, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.310917.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Kim, Kyu Seob. "Transmission scheduling with deadline and throughput constraints." Thesis, Massachusetts Institute of Technology, 2013. http://hdl.handle.net/1721.1/84868.

Full text

Abstract:

Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2013.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (pages 81-82).<br>Today wireless networks are increasingly used to perform applications with Quality of Service constraints (QoS) such as delay, delivery ratio, and channel reliability. Especially, as demand for real-time transmissions increases, transmitting packets with hard delivery deadlines poses an important network control problem. In this thesis, we propose a framework for characterizing feasibi

APA, Harvard, Vancouver, ISO, and other styles

6

杜家強 and Kar-keung To. "On-line deadline scheduling under relaxed metrics of optimality." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2000. http://hub.hku.hk/bib/B30140882.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

To, Kar-keung. "On-line deadline scheduling under relaxed metrics of optimality /cKar-Keung To." Hong Kong : University of Hong Kong, 2000. http://sunzi.lib.hku.hk/hkuto/record.jsp?B22786442.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Ngan, Tsuen-wan. "On the effectiveness of additional resources for on-line firm deadline scheduling /." Hong Kong : University of Hong Kong, 2002. http://sunzi.lib.hku.hk/hkuto/record.jsp?B24520962.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Zhu, Kaiqian. "Limited Preemptive Earliest Deadline First Scheduling of Real-Time Tasks on Multiprocessors." Thesis, Mälardalens högskola, Inbyggda system, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-28252.

Full text

Abstract:

Real-time systems are employed in many areas, such as aerospace and defenses. In real-time systems, especially in hard real-time systems, it is important to meet the associated time requirements. With the increasing demand for high speed processing capabilities, the requirement for high computing power is becoming more and more urgent. However, it is no longer possible to increase processor speeds because of thermal and power constraints. Consequently, industry has focused on providing more computing capabilities using more number of processors.As to the scheduling policies, they can be classi

APA, Harvard, Vancouver, ISO, and other styles

10

Ta, Thanh Thuy Tien. "New single machine scheduling problems with deadline for the characterization of optimal solutions." Thesis, Tours, 2018. http://www.theses.fr/2018TOUR4015/document.

Full text

Abstract:

Nous considérons un problème d'ordonnancement à une machine avec dates de fin impératives et nous cherchons caractériser l'ensemble des solutions optimales, sans les énumérer. Nous supposons que les travaux sont numérotés selon la règle EDD et que cette séquence est réalisable. La méthode consiste à utiliser le treillis des permutations et d'associer à la permutation maximale du treillis la séquence EDD. Afin de caractériser beaucoup de solutions, nous cherchons une séquence réalisable aussi loin que possible de cette séquence. La distance utilisée est le niveau de la séquence dans le treillis

APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Deadline Scheduling"

1

Stankovic, John A., Marco Spuri, Krithi Ramamritham, and Giorgio C. Buttazzo. Deadline Scheduling for Real-Time Systems. Springer US, 1998. http://dx.doi.org/10.1007/978-1-4615-5535-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Brian, Loïc P. Meeting deadlines in hard real-time systems: The rate monotonic approach. IEEE Computer Society, 1999.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

Briand, Loïc P. Meeting deadlines in hard real-time systems: The rate monotonic approach. IEEE Computer Society, 1999.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

Stankovic, John A., Marco Spuri, and Krithi Ramamritham. Deadline Scheduling for Real-Time Systems. Springer, 2011.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

Stankovic, John A., Marco Spuri, Krithi Ramamritham, and Giorgio C. Buttazzo. Deadline Scheduling for Real-Time Systems: EDF and Related Algorithms. Springer London, Limited, 2012.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

Stankovic, John A. Deadline Scheduling for Real-Time Systems: Edf And Related Algorithms. Springer, 2013.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

7

A, Stankovic John, ed. Deadline scheduling for real-time systems: EDF and related algorithms. Kluwer Academic Publishers, 1998.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

8

Scheler, Fabian. Atomic basic blocks: Eine Abstraktion für die gezielte Manipulation der Echtzeitsystemarchitektur. 2011.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

Stankovic, John A., Marco Spuri, Giorgio C. Buttazzo, and Krithi Ramamritham. Deadline Scheduling for Real-Time Systems - EDF and Related Algorithms (The International Series in Engineering and Computer Science). Springer, 1998.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

10

Static-Task Scheduling Incorporating Precedence Constraints and Deadlines in a Heterogeneous-Computing Environment. Storming Media, 2000.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Deadline Scheduling"

1

Kolisch, Rainer. "Project Scheduling with Given Deadline." In Project Scheduling under Resource Constraints. Physica-Verlag HD, 1995. http://dx.doi.org/10.1007/978-3-642-50296-5_7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Stankovic, John A., Marco Spuri, Krithi Ramamritham, and Giorgio C. Buttazzo. "Planning-Based Scheduling." In Deadline Scheduling for Real-Time Systems. Springer US, 1998. http://dx.doi.org/10.1007/978-1-4615-5535-3_5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Stankovic, John A., Marco Spuri, Krithi Ramamritham, and Giorgio C. Buttazzo. "Aperiodic Task Scheduling." In Deadline Scheduling for Real-Time Systems. Springer US, 1998. http://dx.doi.org/10.1007/978-1-4615-5535-3_8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Burns, Alan, and Andy Wellings. "Deadline-Aware Programming and Scheduling." In Reliable Software Technologies – Ada-Europe 2014. Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-08311-7_9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Stankovic, John A., Marco Spuri, Krithi Ramamritham, and Giorgio C. Buttazzo. "Distributed Scheduling — Part II." In Deadline Scheduling for Real-Time Systems. Springer US, 1998. http://dx.doi.org/10.1007/978-1-4615-5535-3_10.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Stankovic, John A., Marco Spuri, Krithi Ramamritham, and Giorgio C. Buttazzo. "Fundamentals of EDF Scheduling." In Deadline Scheduling for Real-Time Systems. Springer US, 1998. http://dx.doi.org/10.1007/978-1-4615-5535-3_3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Stankovic, John A., Marco Spuri, Krithi Ramamritham, and Giorgio C. Buttazzo. "Distributed Scheduling — Part I." In Deadline Scheduling for Real-Time Systems. Springer US, 1998. http://dx.doi.org/10.1007/978-1-4615-5535-3_9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Stankovic, John A., Marco Spuri, Krithi Ramamritham, and Giorgio C. Buttazzo. "Response Times under EDF Scheduling." In Deadline Scheduling for Real-Time Systems. Springer US, 1998. http://dx.doi.org/10.1007/978-1-4615-5535-3_4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Stankovic, John A., Marco Spuri, Krithi Ramamritham, and Giorgio C. Buttazzo. "EDF Scheduling for Shared Resources." In Deadline Scheduling for Real-Time Systems. Springer US, 1998. http://dx.doi.org/10.1007/978-1-4615-5535-3_6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Stankovic, John A., Marco Spuri, Krithi Ramamritham, and Giorgio C. Buttazzo. "Introduction." In Deadline Scheduling for Real-Time Systems. Springer US, 1998. http://dx.doi.org/10.1007/978-1-4615-5535-3_1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Deadline Scheduling"

1

Lee, Jae-Ha. "Online deadline scheduling." In the fifteenth annual ACM symposium. ACM Press, 2003. http://dx.doi.org/10.1145/777412.777416.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Gonzalez, Carlos, and Kyung Y. Jo. "Scheduling with deadline requirements." In the 1985 ACM annual conference. ACM Press, 1985. http://dx.doi.org/10.1145/320435.320570.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Anderson, Eric, Yunhong Zhou, Dirk Beyer, et al. "Deadline scheduling for animation rendering." In the 2005 ACM SIGMETRICS international conference. ACM Press, 2005. http://dx.doi.org/10.1145/1064212.1064266.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Chen, Shiyao, Lang Tong, and Ting He. "Optimal deadline scheduling with commitment." In 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton). IEEE, 2011. http://dx.doi.org/10.1109/allerton.2011.6120157.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Yu, Zhe, Yunjian Xu, and Lang Tong. "Deadline scheduling as restless bandits." In 2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton). IEEE, 2016. http://dx.doi.org/10.1109/allerton.2016.7852304.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Xu, Jia. "Pre-Run-Time Scheduling of Asynchronous and Periodic Processes With Offsets, Release Times, Deadlines, Precedence and Exclusion Relations." In ASME 2009 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2009. http://dx.doi.org/10.1115/detc2009-87769.

Full text

Abstract:

Utilizing non-zero offsets when scheduling real-time periodic processes significantly increases the chances of satisfying all the timing constraints in a real-time system. In this paper, a method that enables the utilization of non-zero offsets in the pre-run-time scheduling of asynchronous and periodic processes with release times, deadlines, precedence and exclusion relations on either a uniprocessor or on a multiprocessor in real-time embedded systems is presented. This paper also identifies for the first time, the set of general conditions that a periodic process newpi with release time rn

APA, Harvard, Vancouver, ISO, and other styles

7

Zhao, Xuejing, Yehua Wei, and Wenjia Li. "The Improved Earliest Deadline First with Virtual Deadlines Mixed-Criticality Scheduling Algorithm." In 2017 IEEE International Symposium on Parallel and Distributed Processing with Applications and 2017 IEEE International Conference on Ubiquitous Computing and Communications (ISPA/IUCC). IEEE, 2017. http://dx.doi.org/10.1109/ispa/iucc.2017.00072.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Miao, X., P. B. Luh, and D. L. Kleinman. "Dynamic job scheduling with strict deadline." In 29th IEEE Conference on Decision and Control. IEEE, 1990. http://dx.doi.org/10.1109/cdc.1990.203556.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Wu, Huasen, Xiaojun Lin, Xin Liu, and Youguang Zhang. "Application-level scheduling with deadline constraints." In IEEE INFOCOM 2014 - IEEE Conference on Computer Communications. IEEE, 2014. http://dx.doi.org/10.1109/infocom.2014.6848189.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Gushchin, Andrey, Shih-Hao Tseng, and Ao Tang. "Optimization-based network flow deadline scheduling." In 2016 IEEE 24th International Conference on Network Protocols (ICNP). IEEE, 2016. http://dx.doi.org/10.1109/icnp.2016.7784415.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Deadline Scheduling"

1

Andersson, Bjorn A., Dionisio de Niz, Hyoseung Kim, Mark Klein, and Ragunathan Rajkumar. Scheduling Constrained-Deadline Sporadic Parallel Tasks Considering Memory Contention. Defense Technical Information Center, 2014. http://dx.doi.org/10.21236/ada610918.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Andersson, Bjorn A. Supplementary material for the paper Scheduling Constrained-Deadline Sporadic Parallel. Defense Technical Information Center, 2014. http://dx.doi.org/10.21236/ada613941.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Andersson, Bjorn A., and Gurulingesh Raravi. Scheduling Constrained-Deadline Parallel Tasks on Two-type Heterogeneous Multiprocessors. Defense Technical Information Center, 2015. http://dx.doi.org/10.21236/ada614630.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Bhattacharya, Partha P., and Anthony Ephremides. Optimal Scheduling with Strict Deadlines. Defense Technical Information Center, 1989. http://dx.doi.org/10.21236/ada454731.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!