Relevant bibliographies by topics / Multiprocessor scheduling / Dissertations / Theses
To see the other types of publications on this topic, follow the link: Multiprocessor scheduling.

Dissertations / Theses on the topic 'Multiprocessor scheduling'

Author: Grafiati
Published: 4 June 2021
Last updated: 25 July 2025

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

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Multiprocessor 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.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Butt, Nouman. "BEE COLONIES APPLIED TO MULTIPROCESSOR SCHEDULING." Thesis, Högskolan Dalarna, Datateknik, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:du-3793.

Full text
Abstract:
In order to achieve the high performance, we need to have an efficient scheduling of a parallelprogram onto the processors in multiprocessor systems that minimizes the entire executiontime. This problem of multiprocessor scheduling can be stated as finding a schedule for ageneral task graph to be executed on a multiprocessor system so that the schedule length can be minimize [10]. This scheduling problem is known to be NP- Hard.In multi processor task scheduling, we have a number of CPU’s on which a number of tasksare to be scheduled that the program’s execution time is minimized. According to
APA, Harvard, Vancouver, ISO, and other styles
2

Arslan, Huseyin Gokseli. "Adaptive cache aware multiprocessor scheduling framework." Thesis, Queensland University of Technology, 2011. https://eprints.qut.edu.au/47602/1/Huseyin_Arslan_Thesis.pdf.

Full text
Abstract:
Computer resource allocation represents a significant challenge particularly for multiprocessor systems, which consist of shared computing resources to be allocated among co-runner processes and threads. While an efficient resource allocation would result in a highly efficient and stable overall multiprocessor system and individual thread performance, ineffective poor resource allocation causes significant performance bottlenecks even for the system with high computing resources. This thesis proposes a cache aware adaptive closed loop scheduling framework as an efficient resource allocation st
APA, Harvard, Vancouver, ISO, and other styles
3

Macey, Benjamin. "Multiprocessor scheduling in the presence of link contention delays." University of Western Australia. School of Electrical, Electronic and Computer Engineering, 2004. http://theses.library.uwa.edu.au/adt-WU2006.0049.

Full text
Abstract:
[Truncated abstract] Parallel computing is recognised today as an important tool in the solution of a wide variety of computationally intensive problems, problems which were previously considered intractable. While it offers the promise of vastly increased performance, parallel computing introduces additional complexities which are not encountered with sequential processing. One of these is the scheduling problem, in which the individual tasks comprising a parallel program are scheduled onto the processors comprising the parallel architecture. The objective is to minimise execution time while
APA, Harvard, Vancouver, ISO, and other styles
4

Rahman, Mostafizur. "Branch and Bound Algorithm for Multiprocessor Scheduling." Thesis, Högskolan Dalarna, Datateknik, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:du-3790.

Full text
Abstract:
The multiprocessor task graph scheduling problem has been extensively studied asacademic optimization problem which occurs in optimizing the execution time of parallelalgorithm with parallel computer. The problem is already being known as one of the NPhardproblems. There are many good approaches made with many optimizing algorithmto find out the optimum solution for this problem with less computational time. One ofthem is branch and bound algorithm.In this paper, we propose a branch and bound algorithm for the multiprocessor schedulingproblem. We investigate the algorithm by comparing two diff
APA, Harvard, Vancouver, ISO, and other styles
5

Hsu, Liangchuan. "Multiprocessor scheduling for hard real-time software." Thesis, Monterey, California. Naval Postgraduate School, 1990. http://hdl.handle.net/10945/30647.

Full text
Abstract:
Approved for public release, distribution is unlimited<br>This thesis builds upon work previously done in the development of the Computer Aided Prototyping System (CAPS) and the Prototype System Description Language (PSDL) and presents a conceptual design for the pioneer prototype of the static scheduler for multiprocessors which are part of the CAPS execution support system. The design of hard real-time systems is gaining importance in the software engineering field as real-world processes are becoming automated. This increase in automation needs the advancement of software design technology
APA, Harvard, Vancouver, ISO, and other styles
6

Li, Hai. "Scheduling algorithms for a multiprocessor DSP platform." Thesis, University of East Anglia, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.426340.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Abdullah, Syed Md Jakaria. "Virtual Clustered-based Multiprocessor Scheduling in Linux Kernel." Thesis, Mälardalens högskola, Akademin för innovation, design och teknik, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-20253.

Full text
Abstract:
Recent advancements of multiprocessor architectures have led to increasing use of multiprocessors in real-time embedded systems. The two most popular real-time scheduling approaches in multiprocessors are global and partitioned scheduling. Cluster based multiprocessor scheduling can be seen as a hybrid approach combining benefits of both partitioned and global scheduling. Virtual clustering further enhances it by providing dynamic cluster resource allocation duringrun-time and applying hierarchical scheduling to ensure temporal isolation between different software components. Over the years, t
APA, Harvard, Vancouver, ISO, and other styles
8

Bhatti, K. "Energy-aware Scheduling for Multiprocessor Real-time Systems." Phd thesis, Université de Nice Sophia-Antipolis, 2011. http://tel.archives-ouvertes.fr/tel-00599980.

Full text
Abstract:
Les applications temps réel modernes deviennent plus exigeantes en termes de ressources et de débit amenant la conception d'architectures multiprocesseurs. Ces systèmes, des équipements embarqués au calculateur haute performance, sont, pour des raisons d'autonomie et de fiabilité, confrontés des problèmes cruciaux de consommation d'énergie. Pour ces raisons, cette thèse propose de nouvelles techniques d'optimisation de la consommation d'énergie dans l'ordonnancement de systèmes multiprocesseur. La premiére contribution est un algorithme d'ordonnancement hiérarchique á deux niveaux qui autorise
APA, Harvard, Vancouver, ISO, and other styles
9

Zargari, Afshar Sara. "On Resource Sharing under Multiprocessor Semi-Partitioned Scheduling." Thesis, Mälardalens högskola, Akademin för innovation, design och teknik, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-14500.

Full text
Abstract:
Semi-partitioned scheduling has been the subject of interest compared to conventional global and partitioned scheduling algorithms for multiprocessors due to better utilization results. In Semi-partitioned scheduling most of tasks are assigned to fixed processors while a few number of tasks are split up and allocated to different processors. Various techniques have been proposed recently on different assigning protocols under semi-partitioned scheduling. Yet an appropriate synchronization mechanism for resource sharing in semi-partitioned scheduling have not been investigated. In this thesis w
APA, Harvard, Vancouver, ISO, and other styles
10

Liu, Minru. "Scheduling on a scalable multiprocessor-based telephone switch." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape3/PQDD_0015/MQ57775.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
11

Bhatti, Muhammad Khurram. "Energy-aware scheduling for multiprocessor real-time systems." Nice, 2011. http://www.theses.fr/2011NICE4010.

Full text
Abstract:
Les applications temps réel modernes deviennent plus exigeantes en termes de ressources et de débit amenant la conception d’architectures multiprocesseurs. Ces systèmes, des équipements embarqués au calculateur haute performance, sont, pour des raisons d’autonomie et de fiabilité, confrontés à des problèmes cruciaux de consommation d’énergie. Pour ces raisons, cette thèse propose de nouvelles techniques d’optimisation de la consommation d’énergie dans l’ordonnancement de systèmes multiprocesseur. La première contribution est un algorithme d’ordonnancement hiérarchique à deux niveaux qui autori
APA, Harvard, Vancouver, ISO, and other styles
12

Liu, Minru Carleton University Dissertation Engineering Systems and Computer. "Scheduling on a scalable multiprocessor-based telephone switch." Ottawa, 2000.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
13

Rosas, Ham Demian. "Dynamic scheduling in multicore processors." Thesis, University of Manchester, 2012. https://www.research.manchester.ac.uk/portal/en/theses/dynamic-scheduling-in-multicore-processors(c96d6641-ba16-44d2-9da5-34c41fd15956).html.

Full text
Abstract:
The advent of multi-core processors, particularly with projections that numbers of cores will continue to increase, has focused attention on parallel programming. It is widely recognized that current programming techniques, including those that are used for scientific parallel programming, will not allow the easy formulation of general purpose applications. An area which is receiving interest is the use of programming styles which do not have side-effects. Previous work on parallel functional programming demonstrated the potential of this to permit the easy exploitation of parallelism. This th
APA, Harvard, Vancouver, ISO, and other styles
14

Heuer, Jörg. "Das Multiprocessor Scheduling-Problem mit reihenfolgeabhängigen Rüstzeiten : heuristische Lösungsverfahren /." Wiesbaden : Dt. Univ.-Verl, 2004. http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&doc_number=013210456&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA.

Full text
APA, Harvard, Vancouver, ISO, and other styles
15

Koo, Ja-Ryeong. "Global scheduling on temperature-constrained multiprocessor real-time systems." Texas A&M University, 2008. http://hdl.handle.net/1969.1/85913.

Full text
Abstract:
In this thesis, we study temperature-constrained multiprocessor real-time systems, where real-time guarantees must be met without exceeding safe temperature levels within the processors. We focus on Pfair scheduling algorithms, especially ERfair scheduling scheme (a work-conserving extension to Pfair scheduling) as our main multiprocessor real-time scheduling methodology. Then, we study the benefits of simple reactive speed scaling as described in the real-time multiprocessor systems. In this thesis, in support of the temperature-awareness, we extend the applicability of the reactive speed sca
APA, Harvard, Vancouver, ISO, and other styles
16

Nelissen, Geoffrey. "Efficient optimal multiprocessor scheduling algorithms for real-time systems." Doctoral thesis, Universite Libre de Bruxelles, 2013. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/209528.

Full text
Abstract:
Real-time systems are composed of a set of tasks that must respect some deadlines. We find them in applications as diversified as the telecommunications, medical devices, cars, planes, satellites, military applications, etc. Missing deadlines in a real-time system may cause various results such as a diminution of the quality of service provided by the system, the complete stop of the application or even the death of people. Being able to prove the correct operation of such systems is therefore primordial. This is the goal of the real-time scheduling theory.<p><p>These last years, we have witne
APA, Harvard, Vancouver, ISO, and other styles
17

Nélis, Vincent. "Energy-aware real-time scheduling in embedded multiprocessor systems." Doctoral thesis, Universite Libre de Bruxelles, 2010. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/210058.

Full text
Abstract:
Nowadays, computer systems are everywhere. From simple portable devices such as watches and MP3 players to large stationary installations that control nuclear power plants, computer systems are now present in all aspects of our modern and every-day life. In about only 70 years, they have completely perturbed our way of life and they reached a so high degree of sophistication that they will be soon capable of driving our cars and cleaning our houses without any human intervention. As computer systems gain in responsibilities, it becomes essential that they provide both safety and reliability. I
APA, Harvard, Vancouver, ISO, and other styles
18

Parsons, Eric W. "Using knowledge of job characteristics in multiprogrammed multiprocessor scheduling." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk2/tape16/PQDD_0013/NQ28033.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
19

Lynch, Gerard. "Parallel job scheduling on heterogeneous networks of multiprocessor workstations." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape7/PQDD_0006/MQ45952.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
20

Fisher, Nathan Wayne Baruah Sanjoy K. "The multiprocessor real-time scheduling of general task systems." Chapel Hill, N.C. : University of North Carolina at Chapel Hill, 2007. http://dc.lib.unc.edu/u?/etd,1108.

Full text
Abstract:
Thesis (Ph. D.)--University of North Carolina at Chapel Hill, 2007.<br>Title from electronic title page (viewed Mar. 27, 2008). "... in partial fulfillment of the requirements for the degree of Doctor of Philosophy in the Department of Computer Science." Discipline: Computer Science; Department/School: Computer Science.
APA, Harvard, Vancouver, ISO, and other styles
21

Squillante, Mark S. "Issues in shared-memory multiprocessor scheduling : a performance evaluation /." Thesis, Connect to this title online; UW restricted, 1990. http://hdl.handle.net/1773/6858.

Full text
APA, Harvard, Vancouver, ISO, and other styles
22

Waters, Andrew Philip. "Program analysis and scheduling for a synchronous multiprocessor machine." Thesis, Royal Holloway, University of London, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.362649.

Full text
APA, Harvard, Vancouver, ISO, and other styles
23

Zhou, Hongyi. "Task scheduling and synchronization for multiprocessor real-time systems." Diss., Georgia Institute of Technology, 1992. http://hdl.handle.net/1853/9178.

Full text
APA, Harvard, Vancouver, ISO, and other styles
24

Kim, Hyun Soo. "Bat Intelligent Hunting Optimization with Application to Multiprocessor Scheduling." Case Western Reserve University School of Graduate Studies / OhioLINK, 2010. http://rave.ohiolink.edu/etdc/view?acc_num=case1274471808.

Full text
APA, Harvard, Vancouver, ISO, and other styles
25

Regnier, Paul Denis Etenne. "Optimal Multiprocessor Real-Time Scheduling via Reduction to Uniprocessor." http://wiki.dcc.ufba.br/PMCC/PaulRegnier, 2013. http://wiki.dcc.ufba.br/PMCC/PaulRegnier.

Full text
Abstract:
Submitted by Santos Davilene (davilenes@ufba.br) on 2013-01-25T12:25:33Z No. of bitstreams: 1 TESE - Paul Regnier.pdf: 1122807 bytes, checksum: 968bc4ff6e54e1d57a2a511a607af27d (MD5)<br>Made available in DSpace on 2013-01-25T12:25:33Z (GMT). No. of bitstreams: 1 TESE - Paul Regnier.pdf: 1122807 bytes, checksum: 968bc4ff6e54e1d57a2a511a607af27d (MD5)<br>Neste trabalho de doutorado, propõe-se RUN (Redução para Uniprocessor), um novo algoritmo de escalonamento para conjunto de tarefas periódicas com deadlines implícitas em sistemas multiprocessador de tempo real, nos quais as tarefas possuem res
APA, Harvard, Vancouver, ISO, and other styles
26

Amphlett, Robert W. "Multiprocessor techniques for high quality digital audio." Thesis, University of Bristol, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.337273.

Full text
APA, Harvard, Vancouver, ISO, and other styles
27

Müller, Dirk, and Matthias Werner. "Improved Heuristics for Partitioned Multiprocessor Scheduling Based on Rate-Monotonic Small-Tasks." Universitätsbibliothek Chemnitz, 2012. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-qucosa-80762.

Full text
Abstract:
Partitioned preemptive EDF scheduling is very similar to bin packing, but there is a subtle difference. Estimating the probability of schedulability under a given total utilization has been studied empirically before. Here, we show an approach for closed-form formulae for the problem, starting with n = 3 tasks on m = 2 processors.
APA, Harvard, Vancouver, ISO, and other styles
28

Bremang, Appah. "Using ant colonies for solve the multiprocessor task graph scheduling." Thesis, Högskolan Dalarna, Datateknik, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:du-2381.

Full text
Abstract:
The problem of scheduling a parallel program presented by a weighted directed acyclic graph (DAG) to the set of homogeneous processors for minimizing the completion time of the program has been extensively studied as academic optimization problem which occurs in optimizing the execution time of parallel algorithm with parallel computer.In this paper, we propose an application of the Ant Colony Optimization (ACO) to a multiprocessor scheduling problem (MPSP). In the MPSP, no preemption is allowed and each operation demands a setup time on the machines. The problem seeks to compose a schedule th
APA, Harvard, Vancouver, ISO, and other styles
29

Rahin, Mohammad A. "Parallel scheduling of concurrent VLSI simulation modules onto a multiprocessor." Thesis, Loughborough University, 1991. https://dspace.lboro.ac.uk/2134/27133.

Full text
Abstract:
The first of the two algorithms examined is the Concurrent Recursive Binary Partitioning (CRBP). This heuristic is based on Kernighan-Lin's graph bi-partitioning algorithm. An L-way partition is achieved by applying binary partitioning recursively, the procedure taking the form of a binary tree. In its parallel implementation each node of this tree is executed independently by a group of available processors and only the best among the solutions obtained is accepted. This provides enhanced processor utilisation and also assures improved results. The factors affecting the performance of the L-w
APA, Harvard, Vancouver, ISO, and other styles
30

Qamhieh, Manar. "Scheduling of parallel real-time DAG tasks on multiprocessor systems." Thesis, Paris Est, 2015. http://www.theses.fr/2015PEST1030/document.

Full text
Abstract:
Les applications temps réel durs sont celles qui doivent exécuter en respectant des contraintes temporelles. L'ordonnancement temps réel a bien été étudié sur mono-processeurs depuis plusieurs années. Récemment, l'utilisation d'architectures multiprocesseurs a augmenté dans les applications industrielles et des architectures parallèles sont proposées pour que le logiciel devienne compatible avec ces plateformes. L'ordonnancement multiprocesseurs de tâches parallèles dépendantes n'est pas une simple généralisation du cas mono-processeur et la problématique d'ordonnancement devient plus complexe
APA, Harvard, Vancouver, ISO, and other styles
31

Etemadi, Reza Carleton University Dissertation Engineering Systems and Computer. "End-to-end scheduling in hard real-time multiprocessor systems." Ottawa, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
32

Varghese, B., M. Alamgir Hossain, and Keshav P. Dahal. "Scheduling of tasks in multiprocessor system using hybrid genetic algorithms." Springer Verlag, 2007. http://hdl.handle.net/10454/2552.

Full text
Abstract:
This paper presents an investigation into the optimal scheduling of realtime tasks of a multiprocessor system using hybrid genetic algorithms (GAs). A comparative study of heuristic approaches such as `Earliest Deadline First (EDF)¿ and `Shortest Computation Time First (SCTF)¿ and genetic algorithm is explored and demonstrated. The results of the simulation study using MATLAB is presented and discussed. Finally, conclusions are drawn from the results obtained that genetic algorithm can be used for scheduling of real-time tasks to meet deadlines, in turn to obtain high processor utilizat
APA, Harvard, Vancouver, ISO, and other styles
33

Courbin, Pierre. "Scheduling sequential or parallel hard real-time pre-emptive tasks upon identical multiprocessor platforms." Thesis, Paris Est, 2013. http://www.theses.fr/2013PEST1081/document.

Full text
Abstract:
L'ordonnancement de tâches sur un système temps réel dur correspond à trouver une façon de choisir, à chaque instant, quelle tâche doit être exécutée sur le processeur pour que chacune ait le temps de terminer son travail avant son échéance. Ce problème, dans le contexte monoprocesseur, est déjà bien étudié et permet des applications sur des systèmes en production (aérospatiale, bourse etc.). Aujourd'hui, les plateformes multiprocesseur se sont généralisées et ont amené de nombreuses questions telles que l'utilisation efficace de tous les processeurs. Dans cette thèse, nous explorons les appro
APA, Harvard, Vancouver, ISO, and other styles
34

Negelspach, Greg L. "Grain size management in repetitive task graphs for multiprocessor computer scheduling." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 1994. http://handle.dtic.mil/100.2/ADA288575.

Full text
APA, Harvard, Vancouver, ISO, and other styles
35

Nikitovic, Mladen. "Reducing Energy Consumption through Adaptive Shutdown Scheduling on a Chip-Multiprocessor." Licentiate thesis, KTH, Microelectronics and Information Technology, IMIT, 2004. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-1774.

Full text
Abstract:
<p>There is seemingly a never-ending consumer demand for mobileterminals such as cellular phones and personal digitalassistants (PDAs). Each new generation of terminals comes withmore elaborate functions than in the previous generation. Thistrend results in a higher performance demand on the computerarchitecture that performs the required computations within theterminal. To satisfy the projected requirements on cominggenerations of mobile terminals, we propose an architecturethat when intelligently managed can provide the necessaryperformance at low power and energy consumption. Thisarchitectu
APA, Harvard, Vancouver, ISO, and other styles
36

Callerström, Emma, and Kajsa Elfström. "Multiprocessor Scheduling of Synchronous Data Flow Graphs using Local Search Algorithms." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-177144.

Full text
Abstract:
Design space exploration (DSE) is the process of exploring design alternatives before implementing real-time multiprocessor systems. One part of DSE is scheduling of the applications the system is developed for and to evaluate the performance to ensure that the real-time requirements are satisfied. Many real-time systems today use multiprocessors and finding the optimal schedule for an application on a multiprocessor system is known to be an NP-hard problem. Such an optimization problem can be time-consuming which justifies the use of heuristics. This thesis presents an approach for scheduling
APA, Harvard, Vancouver, ISO, and other styles
37

CALLERSTRÖM, EMMA, and KAJSA ELFSTRÖM. "Multiprocessor Scheduling of Synchronous Data Flow Graphs using Local Search Algorithms." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-166404.

Full text
Abstract:
Design space exploration (DSE) is the process of exploring design alternatives before implementing real-time multiprocessor systems. One part of DSE is scheduling of the applications the system is developed for and to evaluate the performance to ensure that the real-time requirements are satisfied. Many real-time systems today use multiprocessors and finding the optimal schedule for an application on a multiprocessor system is known to be an NP-hard problem. Such an optimization problem can be time-consuming which justifies the use of heuristics. This thesis presents an approach for scheduling
APA, Harvard, Vancouver, ISO, and other styles
38

Boberg, Jessika. "A comparison of sequencing formulations in a constraint generation procedure for avionics scheduling." Thesis, Linköpings universitet, Optimeringslära, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-143274.

Full text
Abstract:
This thesis compares different mixed integer programming (MIP) formulations for sequencing of tasks in the context of avionics scheduling. Sequencing is a key concern in many discrete optimisation problems, and there are numerous ways of accomplishing sequencing with different MIP formulations. A scheduling tool for avionic systems has previously been developed in a collaboration between Saab and Linköping University. This tool includes a MIP formulation of the scheduling problem where one of the model components has the purpose to sequence tasks. In this thesis, this sequencing component is r
APA, Harvard, Vancouver, ISO, and other styles
39

Müller, Dirk. "Schedulability Tests for Real-Time Uni- and Multiprocessor Systems." Doctoral thesis, Universitätsbibliothek Chemnitz, 2014. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-qucosa-137767.

Full text
Abstract:
This work makes significant contributions in the field of sufficient schedulability tests for rate-monotonic scheduling (RMS) and their application to partitioned RMS. Goal is the maximization of possible utilization in worst or average case under a given number of processors. This scenario is more realistic than the dual case of minimizing the number of necessary processors for a given task set since the hardware is normally fixed. Sufficient schedulability tests are useful for quick estimates of task set schedulability in automatic system-synthesis tools and in online scheduling where exact
APA, Harvard, Vancouver, ISO, and other styles
40

Montcalm, Michael R. "Scheduling Algorithms for Instruction Set Extended Symmetrical Homogeneous Multiprocessor Systems-on-Chip." Thèse, Université d'Ottawa / University of Ottawa, 2011. http://hdl.handle.net/10393/20056.

Full text
Abstract:
Embedded system designers face multiple challenges in fulfilling the runtime requirements of programs. Effective scheduling of programs is required to extract as much parallelism as possible. These scheduling algorithms must also improve speedup after instruction-set extensions have occurred. Scheduling of dynamic code at run time is made more difficult when the static components of the program are scheduled inefficiently. This research aims to optimize a program’s static code at compile time. This is achieved with four algorithms designed to schedule code at the task and instruction level. Ad
APA, Harvard, Vancouver, ISO, and other styles
41

Christodouleas, James D. "Solution methods for multiprocessor network scheduling problems, with application to railroad operations." Thesis, Massachusetts Institute of Technology, 1997. http://hdl.handle.net/1721.1/10352.

Full text
APA, Harvard, Vancouver, ISO, and other styles
42

Shehzad, Muhammad Naeem. "Overhead control in optimal global scheduling algorithms for real-time multiprocessor systems." Nantes, 2013. https://archive.bu.univ-nantes.fr/pollux/show/show?id=d94bf251-4439-41e5-94d6-7dca403c050d.

Full text
Abstract:
En théorie, les algorithmes optimaux d’ordonnancement global permettent d’obtenir une meilleure utilisation des ressources processeur que les algorithmes d'ordonnancement partitionnés, mais pratiquement ils sont considérés comme inférieurs, car ils provoquent une grande quantité de surcoûts d’exécution. Cette surcharge est due à des points d'ordonnancement fréquents, ainsi que les migrations et les préemptions pour les tâches. Dans cette thèse, nous avons choisi une classe d'ordonnancement optimal connu sous le nom de DP-Fair et nous avons mis au point quelques techniques pour maîtriser la sur
APA, Harvard, Vancouver, ISO, and other styles
43

Nakamura, Akira. "An investigation of real-time synchronization." Thesis, University of Cambridge, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.321529.

Full text
APA, Harvard, Vancouver, ISO, and other styles
44

Happe, Jens. "Predicting software performance in symmetric multi-core and multiprocessor environments." Karlsruhe Univ.-Verl. Karlsruhe, 2008. http://d-nb.info/995735956/04.

Full text
APA, Harvard, Vancouver, ISO, and other styles
45

Khan, Jadoon Jabran. "Evaluation of power management strategies on actual multiprocessor platforms." Phd thesis, Université Nice Sophia Antipolis, 2013. http://tel.archives-ouvertes.fr/tel-00838799.

Full text
Abstract:
The purpose of this study is to investigate how power management strategies can be efficiently exploited in actual platforms. Primarily, the challenges in multicore based embedded systems lies in managing the energy expenditure, determining the scheduling behavior and establishing methods to monitor power and energy, so as to meet the demands of the battery life and load requirements. The work presented in this dissertation is a study of low power-aware strategies in the practical world for single and multiprocessor platforms. The approach used for this study is based on representative multipr
APA, Harvard, Vancouver, ISO, and other styles
46

Teller, Justin Stevenson. "Scheduling Tasks on Heterogeneous Chip Multiprocessors with Reconfigurable Hardware." The Ohio State University, 2008. http://rave.ohiolink.edu/etdc/view?acc_num=osu1211985748.

Full text
APA, Harvard, Vancouver, ISO, and other styles
47

Jackson, Laura Elizabeth. "The Directional p-Median Problem with Applications to Traffic Quantization and Multiprocessor Scheduling." NCSU, 2003. http://www.lib.ncsu.edu/theses/available/etd-11052003-111956/.

Full text
Abstract:
An instance of a p-median problem gives n demand points. The objective is to locate p supply points in order to minimize the total distance of the demand points to their nearest supply point. P-median is polynomially solvable in one dimension but NP-hard in two or more dimensions, when either the Euclidean or the rectilinear distance measure is used. In this thesis, we treat the p-median problem under a new distance measure, the directional rectilinear distance, which requires the nearest supply point for a given demand point to lie above and to the right of it. This restriction has applicatio
APA, Harvard, Vancouver, ISO, and other styles
48

Arafa, Hicham Abdel-Hamid. "An adaptive dynamic scheduling technique for parallel loops on shared memory multiprocessor systems." Morgantown, W. Va. : [West Virginia University Libraries], 1999. http://etd.wvu.edu/templates/showETD.cfm?recnum=851.

Full text
Abstract:
Thesis (M.S.)--West Virginia University, 1999.<br>Title from document title page. Document formatted into pages; contains viii, 82 p. : ill. (some col.) Vita. Includes abstract. Includes bibliographical references (p. 77-79).
APA, Harvard, Vancouver, ISO, and other styles
49

Garyali, Piyush. "On Best-Effort Utility Accrual Real-Time Scheduling on Multiprocessors." Thesis, Virginia Tech, 2010. http://hdl.handle.net/10919/34112.

Full text
Abstract:
We consider the problem of scheduling real-time tasks on a multiprocessor system. Our primary focus is scheduling on multiprocessor systems where the total task utilization demand, U, is greater than m, the number of processors on a multiprocessor system---i.e., the total available processing capacity of the system. When U > m, the system is said to be overloaded; otherwise, the system is said to be underloaded. While significant literature exists on multiprocessor real-time scheduling during underloads, little is known about scheduling during overloads, in particular, in the presence of task
APA, Harvard, Vancouver, ISO, and other styles
50

Grigoriu, Liliana. "Multiprocessor Scheduling with Availability Constraints." 2010. http://hdl.handle.net/1969.1/ETD-TAMU-2010-05-7694.

Full text
Abstract:
We consider the problem of scheduling a given set of tasks on multiple pro- cessors with predefined periods of unavailability, with the aim of minimizing the maximum completion time. Since this problem is strongly NP-hard, polynomial ap- proximation algorithms are being studied for its solution. Among these, the best known are LPT (largest processing time first) and Multifit with their variants. We give a Multifit-based algorithm, FFDL Multifit, which has an optimal worst- case performance in the class of polynomial algorithms for same-speed processors with at most two downtimes on each machin
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the bibliographies on the topic 'Multiprocessor scheduling' for other source types:
Journal articles Books
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!

To the bibliography