Log in

Relevant bibliographies by topics / Non-preemptive scheduling

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

Academic literature on the topic 'Non-preemptive scheduling'

Author: Grafiati

Published: 4 June 2021

Last updated: 3 February 2022

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 'Non-preemptive 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 "Non-preemptive scheduling"

1

Bampis, Evripidis, Alexander Kononov, Dimitrios Letsios, Giorgio Lucarelli, and Ioannis Nemparis. "From preemptive to non-preemptive speed-scaling scheduling." Discrete Applied Mathematics 181 (January 2015): 11–20. http://dx.doi.org/10.1016/j.dam.2014.10.007.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

O'Brien, Gearoid, and Ram Rajagopal. "Scheduling Non-Preemptive Deferrable Loads." IEEE Transactions on Power Systems 31, no. 2 (2016): 835–45. http://dx.doi.org/10.1109/tpwrs.2015.2402198.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Černý, Pavol, Edmund M. Clarke, Thomas A. Henzinger, et al. "From non-preemptive to preemptive scheduling using synchronization synthesis." Formal Methods in System Design 50, no. 2-3 (2016): 97–139. http://dx.doi.org/10.1007/s10703-016-0256-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Sridharan, Sri V., and Zhuoqun Zhou. "Dynamic non-preemptive single machine scheduling." Computers & Operations Research 23, no. 12 (1996): 1183–90. http://dx.doi.org/10.1016/s0305-0548(96)00025-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Burdorf, Christopher, and Jed Marti. "Non-preemptive time warp scheduling algorithms." ACM SIGOPS Operating Systems Review 24, no. 2 (1990): 7–18. http://dx.doi.org/10.1145/382258.382787.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Capota, Eugenia Ana, Cristina Sorina Stangaciu, Mihai Victor Micea, and Daniel-Ioan Curiac. "Towards Fully Jitterless Applications: Periodic Scheduling in Multiprocessor MCSs Using a Table-Driven Approach." Applied Sciences 10, no. 19 (2020): 6702. http://dx.doi.org/10.3390/app10196702.

Full text

Abstract:

In mixed criticality systems (MCSs), the time-triggered scheduling approach focuses on a special case of safety-critical embedded applications which run in a time-triggered environment. Sometimes, for these types of MCSs, perfectly periodical (i.e., jitterless) scheduling for certain critical tasks is needed. In this paper, we propose FENP_MC (Fixed Execution Non-Preemptive Mixed Criticality), a real-time, table-driven, non-preemptive scheduling method specifically adapted to mixed criticality systems which guarantees jitterless execution in a mixed criticality time-triggered environment. We a

APA, Harvard, Vancouver, ISO, and other styles

7

Cardeira, Carlos, and Zoubir Mammeri. "Preemptive and Non-Preemptive Real-Time Scheduling Based on Neural Networks." IFAC Proceedings Volumes 28, no. 22 (1995): 67–72. http://dx.doi.org/10.1016/s1474-6670(17)46670-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Zhang, Zhizhong, Fang Cheng, Jiangtao Luo, Qijian Mao, Jun Wang, and Shaofeng Qiu. "Preemptive and non-preemptive scheduling of optical switches with configuration delay." Science in China Series F: Information Sciences 49, no. 5 (2006): 653–64. http://dx.doi.org/10.1007/s11432-006-2023-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Liu, Tie Wu, Lin Feng Bai, Tie Nan Zhang, and Xi Long Qu. "Algorithm Research for Non-Preemptive Scheduling on Multiprocessor." Applied Mechanics and Materials 34-35 (October 2010): 1770–74. http://dx.doi.org/10.4028/www.scientific.net/amm.34-35.1770.

Full text

Abstract:

Research for algorithm of non-preemptive scheduling on multiprocessor is of great theoretical significance and practical significance. Based on non-preemptive scheduling, the performance of the algorithm is analyzed and investigated on two different objective functions about the turnaround time of the system and the low-cost problem with a limitation of time. Finally, the relevant conclusion is obtained which is the basis of the further research. It gives a guarantee to the algorithm performance which is designed for the practical application.

APA, Harvard, Vancouver, ISO, and other styles

10

Lee, Hoyoun, and Jinkyu Lee. "Limited Non-Preemptive EDF Scheduling for a Real-Time System with Symmetry Multiprocessors." Symmetry 12, no. 1 (2020): 172. http://dx.doi.org/10.3390/sym12010172.

Full text

Abstract:

In a real-time system, a series of jobs invoked by each task should finish its execution before its deadline, and EDF (Earliest Deadline First) is one of the most popular scheduling algorithms to meet such timing constraints of a set of given tasks. However, EDF is known to be ineffective in meeting timing constraints for non-preemptive tasks (which disallow any preemption) when the system does not know the future job release patterns of the tasks. In this paper, we develop a scheduling algorithm for a real-time system with a symmetry multiprocessor platform, which requires only limited inform

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Non-preemptive scheduling"

1

Holappa, M. (Mikko). "Performance comparison of LTE eNodeB OSI layer 2 implementations:preemptive partitioned scheduling vs. non-preemptive global scheduling." Master's thesis, University of Oulu, 2013. http://urn.fi/URN:NBN:fi:oulu-201312021941.

Full text

Abstract:

Radio access networks are constantly evolving into a more data intensive direction, emphasizing lower latencies and higher data rates. The growing number of mobile data users and the amount of data they consume requires more data processing capacity from mobile base stations than ever before. As radio access networks evolve according to 3GPP’s plans, so do base station hardware and software. This thesis presents a method for estimating data-link layer processing latencies in an LTE base station. Estimation helps base station manufacturers identify technical performance bottlenecks. It also pro

APA, Harvard, Vancouver, ISO, and other styles

2

Li, Wenming. "Group-EDF: A New Approach and an Efficient Non-Preemptive Algorithm for Soft Real-Time Systems." Thesis, University of North Texas, 2006. https://digital.library.unt.edu/ark:/67531/metadc5317/.

Full text

Abstract:

Hard real-time systems in robotics, space and military missions, and control devices are specified with stringent and critical time constraints. On the other hand, soft real-time applications arising from multimedia, telecommunications, Internet web services, and games are specified with more lenient constraints. Real-time systems can also be distinguished in terms of their implementation into preemptive and non-preemptive systems. In preemptive systems, tasks are often preempted by higher priority tasks. Non-preemptive systems are gaining interest for implementing soft-real applications on mu

APA, Harvard, Vancouver, ISO, and other styles

3

Tabet, Aouel Nasreddine. "General queueing networks with priorities. Maximum entropy analysis of general queueing network models with priority preemptive resume or head-of-line and non-priority based service disciplines." Thesis, University of Bradford, 1989. http://hdl.handle.net/10454/4214.

Full text

Abstract:

Priority based scheduling disciplines are widely used by existing computer operating systems. However, the mathematical analysis and modelling of these systems present great difficulties since priority schedulling is not compatible with exact product form solutions of queueing network models (QNM's). It is therefore, necessary to employ credible approximate techniques for solving QNM's with priority classes. The principle of maximum entropy (ME) is a method of inference for estimating a probability distribution given prior information in the form of expected values. This principle is

APA, Harvard, Vancouver, ISO, and other styles

4

Marouf, Mohamed. "Ordonnancement temps réel dur multiprocesseur tolérant aux fautes appliqué à la robotique mobile." Phd thesis, Ecole Nationale Supérieure des Mines de Paris, 2012. http://pastel.archives-ouvertes.fr/pastel-00720934.

Full text

Abstract:

Nous nous sommes intéressés dans cette thèse au problème d'ordonnancement temps réel dur multiprocesseur tolérant aux fautes pour des tâches non préemptives périodiques strictes pouvant être combinées avec des tâches préemptives. Nous avons proposé des solutions à ce problème et les avons implantées dans le logiciel SynDEx puis nous les avons testées sur une application de suivi de véhicules électriques CyCabs. Nous avons d'abord présenté un état de l'art sur les systèmes temps réel embarqués et plus précisément sur l'ordonnancement classique monoprocesseur et multiprocesseur de tâches préempt

APA, Harvard, Vancouver, ISO, and other styles

5

Khatib, Jad. "Modélisation et ordonnancement des systèmes temps réel embarqués utilisant des graphes de flots de données synchrones." Electronic Thesis or Diss., Sorbonne université, 2018. http://www.theses.fr/2018SORUS425.

Full text

Abstract:

Les systèmes embarqués temps réel impactent nos vies au quotidien. Leur complexité s’intensifie avec la diversité des applications et l’évolution des architectures des plates-formes de calcul. En effet, les systèmes temps réel peuvent se retrouver dans des systèmes autonomes, comme dans les métros, avions et voitures autonomes. Ils sont donc souvent d’une importance décisive pour la vie humaine, et leur dysfonctionnement peut avoir des conséquences catastrophiques. Ces systèmes sont généralement multi-périodiques car leurs composants interagissent entre eux à des rythmes différents, ce qui raj

APA, Harvard, Vancouver, ISO, and other styles

6

Tabet, Aouel Nasreddine. "General queueing networks with priorities : maximum entropy analysis of general queueing network models with priority pre-emptive resume or head-of-line and non-priority based service disciplines." Thesis, University of Bradford, 1989. http://hdl.handle.net/10454/4214.

Full text

Abstract:

Priority based scheduling disciplines are widely used by existing computer operating systems. However, the mathematical analysis and modelling of these systems present great difficulties since priority schedulling is not compatible with exact product form solutions of queueing network models (QNM's). It is therefore, necessary to employ credible approximate techniques for solving QNM's with priority classes. The principle of maximum entropy (ME) is a method of inference for estimating a probability distribution given prior information in the form of expected values. This principle is applied,

APA, Harvard, Vancouver, ISO, and other styles

7

Lu, Ching-Wei, and 盧慶煒. "Non-Preemptive Completion Time Open Shop Scheduling Problem." Thesis, 2002. http://ndltd.ncl.edu.tw/handle/34721353676303874298.

Full text

Abstract:

碩士<br>朝陽科技大學<br>工業工程與管理系碩士班<br>90<br>The open shop scheduling problem is a hard combinational optimization problem. Most variations of open shop scheduling problems are known to be NP-hard. Polynomial time algorithms only exist for a few special cases. In this research we study the non-preemptive open shop scheduling problem with the objective of minimizing total completion time, which is a strongly NP-hard problem. An open shop can be defined as follows：a set of jobs must be processed by a set of machines where the order of jobs processed on each machine and the order of machines to wh

APA, Harvard, Vancouver, ISO, and other styles

8

Wu, Kuo-Wei, and 吳國偉. "A Study on Project Scheduling under Multiple Constraints and Non-Preemptive Resource Environments." Thesis, 1995. http://ndltd.ncl.edu.tw/handle/35724825156113214777.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Poon, Wing-Chi. "Real-time hierarchical hypervisor." Thesis, 2010. http://hdl.handle.net/2152/ETD-UT-2010-08-1842.

Full text

Abstract:

Both real-time virtualization and recursive virtualization are desirable properties of a virtual machine monitor (or hypervisor). Although the prospect for virtualization and even recursive virtualization has become better as the PC hardware becomes faster, the real-time systems community so far has not been able to reap much benefits. This is because no existing virtualization mechanism can properly support the stringent timing requirements needed by real-time systems. It is hard to do real-time virtualization, and it is even harder to do it recursively. In this dissertation, we propose a fra

APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Non-preemptive scheduling"

1

Burdorf, Christopher. Non-preemptive time-warp scheduling algorithms. Rand Corp., 1990.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Non-preemptive scheduling"

1

Guan, Nan. "Analyzing Non-preemptive Global Scheduling." In Techniques for Building Timing-Predictable Embedded Systems. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-27198-9_5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Bampis, Evripidis, Alexander Kononov, Dimitrios Letsios, Giorgio Lucarelli, and Ioannis Nemparis. "From Preemptive to Non-preemptive Speed-Scaling Scheduling." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-38768-5_14.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Lucarelli, Giorgio, Abhinav Srivastav, and Denis Trystram. "From Preemptive to Non-preemptive Scheduling Using Rejections." In Lecture Notes in Computer Science. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-42634-1_41.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Černý, Pavol, Edmund M. Clarke, Thomas A. Henzinger, et al. "From Non-preemptive to Preemptive Scheduling Using Synchronization Synthesis." In Computer Aided Verification. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-21668-3_11.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Bartusch, M. "Non preemptive Scheduling mit konstanten Vorgangsdauern." In DGOR. Springer Berlin Heidelberg, 1987. http://dx.doi.org/10.1007/978-3-642-72557-9_91.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Ho, Chiahsun, and Shelby H. Funk. "Partially Non-Preemptive Dual Priority Multiprocessor Scheduling." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-25873-2_24.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Mäcker, Alexander, Manuel Malatyali, Friedhelm Meyer auf der Heide, and Sören Riechers. "Non-preemptive Scheduling on Machines with Setup Times." In Lecture Notes in Computer Science. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-21840-3_45.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Jansen, Klaus, and Felix Land. "Non-preemptive Scheduling with Setup Times: A PTAS." In Euro-Par 2016: Parallel Processing. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-43659-3_12.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Albers, Susanne, and Alexander Eckl. "Explorable Uncertainty in Scheduling with Non-uniform Testing Times." In Approximation and Online Algorithms. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-80879-2_9.

Full text

Abstract:

AbstractThe problem of scheduling with testing in the framework of explorable uncertainty models environments where some preliminary action can influence the duration of a task. In the model, each job has an unknown processing time that can be revealed by running a test. Alternatively, jobs may be run untested for the duration of a given upper limit. Recently, Dürr et al. [4] have studied the setting where all testing times are of unit size and have given lower and upper bounds for the objectives of minimizing the sum of completion times and the makespan on a single machine. In this paper, we extend the problem to non-uniform testing times and present the first competitive algorithms. The general setting is motivated for example by online user surveys for market prediction or querying centralized databases in distributed computing. Introducing general testing times gives the problem a new flavor and requires updated methods with new techniques in the analysis. We present constant competitive ratios for the objective of minimizing the sum of completion times in the deterministic case, both in the non-preemptive and preemptive setting. For the preemptive setting, we additionally give a first lower bound. We also present a randomized algorithm with improved competitive ratio. Furthermore, we give tight competitive ratios for the objective of minimizing the makespan, both in the deterministic and the randomized setting.

APA, Harvard, Vancouver, ISO, and other styles

10

Lee, Yong-Jin, Dong-Woo Lee, and Duk-Jin Chang. "Optimal Task Scheduling Algorithm for Non-preemptive Processing System." In Frontiers of WWW Research and Development - APWeb 2006. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11610113_93.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Non-preemptive scheduling"

1

Yu, Ruozhou, Guoliang Xue, Xiang Zhang, and Jian Tang. "Non-Preemptive Coflow Scheduling and Routing." In GLOBECOM 2016 - 2016 IEEE Global Communications Conference. IEEE, 2016. http://dx.doi.org/10.1109/glocom.2016.7842029.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Dahlin, Nathan, and Rahul Jain. "Scheduling of Flexible Non-Preemptive Loads." In 2020 59th IEEE Conference on Decision and Control (CDC). IEEE, 2020. http://dx.doi.org/10.1109/cdc42340.2020.9303825.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Berlińska, Joanna. "Scheduling non-preemptive data gathering affected by background communications." In The Second International Workshop on Dynamic Scheduling Problems. Polish Mathematical Society, 2018. http://dx.doi.org/10.14708/isbn.978-83-951298-0-3p43-46.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Sabin, G., G. Kochhar, and P. Sadayappan. "Job fairness in non-preemptive job scheduling." In International Conference on Parallel Processing, 2004. ICPP 2004. IEEE, 2004. http://dx.doi.org/10.1109/icpp.2004.1327920.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Belgaum, Mohammad Riyaz, Safeeullah Soomro, Zainab Alansari, Muhammad Alam, Shahrulniza Musa, and Mazliham Mohd Su'ud. "Load balancing with preemptive and non-preemptive task scheduling in cloud computing." In 2017 IEEE 3rd International Conference on Engineering Technologies and Social Sciences (ICETSS). IEEE, 2017. http://dx.doi.org/10.1109/icetss.2017.8324145.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Barjouei, A. Shojaei, Abbas Barabadi, and R. Tavakkoli-Moghaddam. "Non-Preemptive Open Shop Scheduling Considering Machine Availability." In 2019 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM). IEEE, 2019. http://dx.doi.org/10.1109/ieem44572.2019.8978648.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Bansal, Nikhil, Ho-Leung Chan, Rohit Khandekar, Kirk Pruhs, Baruch Schieber, and Cliff Stein. "Non-Preemptive Min-Sum Scheduling with Resource Augmentation." In 2007 48th Annual IEEE Symposium on Foundations of Computer Science. IEEE, 2007. http://dx.doi.org/10.1109/focs.2007.11.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Bansal, Nikhil, Ho-Leung Chan, Rohit Khandekar, Kirk Pruhs, Cliff Stein, and Baruch Schieber. "Non-Preemptive Min-Sum Scheduling with Resource Augmentation." In 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07). IEEE, 2007. http://dx.doi.org/10.1109/focs.2007.4389530.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Andersson, Bjorn, Sagar Chaki, Dionisio de Niz, Brian Dougherty, Russell Kegley, and Jules White. "Non-preemptive Scheduling with History-Dependent Execution Time." In 2012 24th Euromicro Conference on Real-Time Systems (ECRTS). IEEE, 2012. http://dx.doi.org/10.1109/ecrts.2012.38.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Baldovin, Andrea, Enrico Mezzetti, and Tullio Vardanega. "Limited preemptive scheduling of non-independent task sets." In 2013 International Conference on Embedded Software (EMSOFT). IEEE, 2013. http://dx.doi.org/10.1109/emsoft.2013.6658596.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Non-preemptive scheduling"

1

Bui, Dai. Revision of a Non-Preemptive EDF Packet Scheduling Algorithm. Defense Technical Information Center, 2009. http://dx.doi.org/10.21236/ada538864.

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!