Relevant bibliographies by topics / Multiprocessor scheduling

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature 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 lists of relevant articles, books, theses, conference reports, and other scholarly sources 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.

Journal articles on the topic "Multiprocessor scheduling"

1

Tafesse, Bisrat, and Venkatesan Muthukumar. "Framework for Simulation of Heterogeneous MpSoC for Design Space Exploration." VLSI Design 2013 (July 11, 2013): 1–16. http://dx.doi.org/10.1155/2013/936181.

Full text
Abstract:
Due to the ever-growing requirements in high performance data computation, multiprocessor systems have been proposed to solve the bottlenecks in uniprocessor systems. Developing efficient multiprocessor systems requires effective exploration of design choices like application scheduling, mapping, and architecture design. Also, fault tolerance in multiprocessors needs to be addressed. With the advent of nanometer-process technology for chip manufacturing, realization of multiprocessors on SoC (MpSoC) is an active field of research. Developing efficient low power, fault-tolerant task scheduling,
APA, Harvard, Vancouver, ISO, and other styles
2

Wu, Peng, and Minsoo Ryu. "EDZL Scheduling and Schedulability Analysis for Performance Asymmetric Multiprocessors." International Journal of Foundations of Computer Science 27, no. 01 (2016): 1–14. http://dx.doi.org/10.1142/s0129054116500015.

Full text
Abstract:
Heterogeneous multiprocessor architectures allow embedded real-time systems to better match computing resources to each application's needs and dynamic workload requirements, thereby providing many opportunities for improved performance with reduced power consumption. Unfortunately, guaranteeing real-time requirements on heterogeneous multiprocessors remains a critical problem due to the lack of appropriate scheduling algorithms and analysis methods. In this paper, we consider EDZL (Earliest Deadline First until Zero-Laxity) for performance asymmetric multiprocessor scheduling. EDZL has been s
APA, Harvard, Vancouver, ISO, and other styles
3

Li, Xiao Fang. "Simulation on Task Scheduling for Multiprocessors Based on Improved Neural Network." Applied Mechanics and Materials 513-517 (February 2014): 2293–96. http://dx.doi.org/10.4028/www.scientific.net/amm.513-517.2293.

Full text
Abstract:
This paper mainly discusses task scheduling for multiprocessors. Application requires higher performance of the multiprocessors task scheduling systems. The traditional algorithms majorly consider the accuracy and neglect the real-time performance. In order to improve the real-time performance while maintaining the accuracy, the paper proposes a task scheduling algorithm (GA-ACO) for multiprocessors based on improved neural network. It first builds mathematical models for task scheduling of multiprocessor systems, and then introduces genetic algorithms to quickly find feasible solutions. The s
APA, Harvard, Vancouver, ISO, and other styles
4

Arslan, Huseyin G., Yu-Chu Tian, Fenglian Li, Chen Peng, and Min-Rui Fei. "Control-theoretic adaptive cache-fair scheduling of chip multiprocessor systems." Transactions of the Institute of Measurement and Control 40, no. 10 (2017): 3095–104. http://dx.doi.org/10.1177/0142331217715064.

Full text
Abstract:
In chip multiprocessor scheduling, cache memory awareness is critical. However, most existing cache-aware multiprocessor scheduling methods are static and open-loop and thus do not work well in dynamic environments. To address this challenging problem, a control-theoretic approach is presented in this paper for adaptive cache-fair multiprocessor scheduling. The adaptive cache-fair multiprocessor scheduling uses process models to estimate the shared cache size requirements and the instruction count variations of the threads running on multiprocessor cores. Then, it feeds the estimated informati
APA, Harvard, Vancouver, ISO, and other styles
5

Wu, Peng, and Minsoo Ryu. "Best Speed Fit EDF Scheduling for Performance Asymmetric Multiprocessors." Mathematical Problems in Engineering 2017 (2017): 1–7. http://dx.doi.org/10.1155/2017/1237438.

Full text
Abstract:
In order to improve the performance of a real-time system, asymmetric multiprocessors have been proposed. The benefits of improved system performance and reduced power consumption from such architectures cannot be fully exploited unless suitable task scheduling and task allocation approaches are implemented at the operating system level. Unfortunately, most of the previous research on scheduling algorithms for performance asymmetric multiprocessors is focused on task priority assignment. They simply assign the highest priority task to the fastest processor. In this paper, we propose BSF-EDF (b
APA, Harvard, Vancouver, ISO, and other styles
6

Ali, Gheni. "Dynamic Task Scheduling in Multiprocessor Real Time Systems Using Genetic Algorithms." Journal of Al-Rafidain University College For Sciences ( Print ISSN: 1681-6870 ,Online ISSN: 2790-2293 ), no. 2 (October 26, 2021): 46–65. http://dx.doi.org/10.55562/jrucs.v23i2.478.

Full text
Abstract:
The objective of the scheduling algorithm is to dynamically schedule as many tasks as possible such that each task meets its execution deadline while minimizing the total delay time of all of the tasks. The problem of scheduling of real-time tasks in multiprocessor systems is to determine when and on which processor a given task executes. In this paper we suggest a genetic algorithm for dynamic scheduling of real time tasks in multiprocessors system.The algorithm based on the use of a fixed size chromosome and repeatedly applying specific crossover (single point or double point) and mutation p
APA, Harvard, Vancouver, ISO, and other styles
7

Murphy, M. C., and D. Rotem. "Multiprocessor join scheduling." IEEE Transactions on Knowledge and Data Engineering 5, no. 2 (1993): 322–38. http://dx.doi.org/10.1109/69.219739.

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

Wu, Peng, Zhi Li, Tao Yan, and Yingchun Li. "Three Processor Allocation Approaches towards EDF Scheduling for Performance Asymmetric Multiprocessors." Applied Sciences 13, no. 9 (2023): 5318. http://dx.doi.org/10.3390/app13095318.

Full text
Abstract:
With the rapid development of high-performance computing and parallel computing technology, by virtue of its cost-effectiveness, strong scalability, and easy programming, the multiprocessor system has gradually become the mainstream computing platform. Meanwhile, a growing number of researchers pay attention to the performance of multiprocessor systems, especially the task scheduling problem, which has an important impact on the system performance. Most of the current research works on task scheduling algorithms are based on the homogeneous computing environment. On the contrary, research work
APA, Harvard, Vancouver, ISO, and other styles
9

Chen, Yumeng, Songlin Liu, Zongmiao He, and Xiang Ling. "A Tetris-Based Task Allocation Strategy for Real-Time Operating Systems." Electronics 14, no. 1 (2024): 98. https://doi.org/10.3390/electronics14010098.

Full text
Abstract:
Real-time constrained multiprocessor systems have been widely applied across various domains. In this paper, we focus on the scheduling algorithm for directed acyclic graph (DAG) tasks under partitioned scheduling on multiprocessor systems. Effective real-time task scheduling algorithms significantly enhance the performance and stability of multiprocessor systems. Traditional real-time task scheduling algorithms commonly rely on a single-heuristic parameter as the reference for task allocation, which typically results in suboptimal performance. Inspired by the Tetris algorithm, we propose a no
APA, Harvard, Vancouver, ISO, and other styles
10

Singh, Sunil Kumar, and Deo Prakash Vidyarthi. "Independent Tasks Scheduling using Parallel PSO in Multiprocessor Systems." International Journal of Grid and High Performance Computing 7, no. 2 (2015): 1–17. http://dx.doi.org/10.4018/ijghpc.2015040101.

Full text
Abstract:
Multiprocessor system often aims to minimize the schedule length of the submitted jobs. For this, efficient scheduling of the parallel tasks on multiprocessor system is required. As the scheduling is an NP-Hard problem, meta-heuristics are often applied for this. This work applies parallel particle swarm optimization technique for multiprocessor task scheduling. As the scheduler designed using parallel PSO itself can execute in parallel on the multiprocessor systems the convergence is faster. The proposed algorithm takes care of local as well as global convergence. The performance evaluation o
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Multiprocessor scheduling"

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
More sources

Books on the topic "Multiprocessor scheduling"

1

Li, Dawei, and Jie Wu. Energy-aware Scheduling on Multiprocessor Platforms. Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4614-5224-9.

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

Baruah, Sanjoy, Marko Bertogna, and Giorgio Buttazzo. Multiprocessor Scheduling for Real-Time Systems. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-08696-5.

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

Li, Dawei. Energy-aware Scheduling on Multiprocessor Platforms. Springer New York, 2013.

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

Heuer, Jörg. Das Multiprocessor Scheduling-Problem mit reihenfolgeabhängigen Rüstzeiten. Deutscher Universitätsverlag, 2004. http://dx.doi.org/10.1007/978-3-322-81886-7.

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

Drozdowski, Maciej. Selected problems of scheduling tasks in multiprocessor computer systems. Politechnika Poznańska, 1997.

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

Moreira, Orlando, and Henk Corporaal. Scheduling Real-Time Streaming Applications onto an Embedded Multiprocessor. Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-01246-9.

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

Parsons, Eric W. Using knowledge of job characteristics in multiprogrammed multiprocessor scheduling. National Library of Canada = Bibliothèque nationale du Canada, 1997.

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

Center, Langley Research, ed. A comparison of multiprocessor scheduling methods for iterative data flow architectures. National Aeronautics and Space Administration, Langley Research Center, 1993.

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

Center, Langley Research, ed. Design tool for multiprocessor scheduling and evaluation of iterative dataflow algorithms. National Aeronautics and Space Administration, Langley Research Center, 1995.

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

Center, Langley Research, ed. Design tool for multiprocessor scheduling and evaluation of iterative dataflow algorithms. National Aeronautics and Space Administration, Langley Research Center, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Multiprocessor scheduling"

1

Brucker, Peter. "Multiprocessor Tasks." In Scheduling Algorithms. Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-24804-0_11.

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

Brucker, Peter. "Multiprocessor Tasks." In Scheduling Algorithms. Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/978-3-662-04550-3_11.

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

Brucker, Peter. "Multiprocessor Tasks." In Scheduling Algorithms. Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/978-3-662-03612-9_11.

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

Brucker, Peter. "Multiprocessor Tasks." In Scheduling Algorithms. Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/978-3-662-03088-2_10.

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

Ansari, Nirwan, and Edwin Hou. "Multiprocessor Scheduling." In Computational Intelligence for Optimization. Springer US, 1997. http://dx.doi.org/10.1007/978-1-4615-6331-0_10.

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

Li, Zhonghua, and Chris C. Kirkham. "Generalized multiprocessor scheduling." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/bfb0024749.

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

Korst, Jan, Emile Aarts, Jan Karel Lenstra, and Jaap Wessels. "Periodic Multiprocessor Scheduling." In Parle ’91 Parallel Architectures and Languages Europe. Springer Berlin Heidelberg, 1991. http://dx.doi.org/10.1007/978-3-662-25209-3_12.

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

Goossens, Joël, and Pascal Richard. "Multiprocessor Architecture Solutions." In Real-Time Systems Scheduling 1. John Wiley & Sons, Inc., 2014. http://dx.doi.org/10.1002/9781118984413.ch3.

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

Blazewicz, Jacek, Klaus H. Ecker, Erwin Pesch, Günter Schmidt, Malgorzata Sterna, and Jan Weglarz. "Communication Delays and Multiprocessor Tasks." In Handbook on Scheduling. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-319-99849-7_6.

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

Amoura, A. K., E. Bampis, C. Kenyon, and Y. Manoussakis. "Scheduling independent multiprocessor tasks." In Algorithms — ESA '97. Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/3-540-63397-9_1.

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

Conference papers on the topic "Multiprocessor scheduling"

1

Vakhania, Nodari. "Global Estimations for Multiprocessor Job-Shop." In 2007 IEEE Symposium on Computational Intelligence in Scheduling. IEEE, 2007. http://dx.doi.org/10.1109/scis.2007.367671.

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

Adyanthaya, Shreya, Marc Geilen, Twan Basten, Jeroen Voeten, and Ramon Schiffelers. "Iterative robust multiprocessor scheduling." In RTNS '15: 23rd International Conference on Real-Time Networks and Systems. ACM, 2015. http://dx.doi.org/10.1145/2834848.2834857.

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

Deng, Xiaotie, and Patrick Dymond. "On multiprocessor system scheduling." In the eighth annual ACM symposium. ACM Press, 1996. http://dx.doi.org/10.1145/237502.237510.

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

Samadzadeh, Farideh A., and G. E. Hedrick. "Near-optimal multiprocessor scheduling." In the 1992 ACM annual conference. ACM Press, 1992. http://dx.doi.org/10.1145/131214.131275.

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

Phillips, Cynthia. "Session details: Multiprocessor scheduling." In SPAA 09: 21st ACM Symposium on Parallelism in Algorithms and Architectures. ACM, 2009. http://dx.doi.org/10.1145/3261158.

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

Andersson, B., and J. Jonsson. "Preemptive multiprocessor scheduling anomalies." In Proceedings 16th International Parallel and Distributed Processing Symposium. IPDPS 2002. IEEE, 2002. http://dx.doi.org/10.1109/ipdps.2002.1015483.

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

Orr, James, and Sanjoy Baruah. "Multiprocessor scheduling of elastic tasks." In the 27th International Conference. ACM Press, 2019. http://dx.doi.org/10.1145/3356401.3356403.

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

"MultiProcessor Scheduling is PLS-Complete." In 2009 42nd Hawaii International Conference on System Sciences. IEEE, 2009. http://dx.doi.org/10.1109/hicss.2009.317.

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

Hamada, T., S. Banerjee, P. M. Chau, and R. D. Fellman. "Macropipelining based heterogeneous multiprocessor scheduling." In [Proceedings] ICASSP-92: 1992 IEEE International Conference on Acoustics, Speech, and Signal Processing. IEEE, 1992. http://dx.doi.org/10.1109/icassp.1992.226549.

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

Nemati, Farhang, Moris Behnam, and Thomas Nolte. "Multiprocessor Synchronization and Hierarchical Scheduling." In 2009 International Conference on Parallel Processing Workshops (ICPPW). IEEE, 2009. http://dx.doi.org/10.1109/icppw.2009.44.

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

Reports on the topic "Multiprocessor scheduling"

1

Miller, Allan. Nonpreemptive run-time scheduling issues on a multitasked, multiprogrammed multiprocessor with dependencies, bidimensional tasks, folding and dynamic graphs. Office of Scientific and Technical Information (OSTI), 1987. http://dx.doi.org/10.2172/5546139.

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

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
You might also be interested in the extended bibliographies on the topic 'Multiprocessor scheduling' for particular source types:
Journal articles Dissertations / Theses 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