Log in

Relevant bibliographies by topics / Multiprocessor Systems - Scheduling Algorithms / Journal articles

To see the other types of publications on this topic, follow the link: Multiprocessor Systems - Scheduling Algorithms.

Journal articles on the topic 'Multiprocessor Systems - Scheduling Algorithms'

Author: Grafiati

Published: 4 June 2021

Last updated: 6 September 2023

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

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Multiprocessor Systems - Scheduling Algorithms.'

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 journal articles on a wide variety of disciplines and organise your bibliography correctly.

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

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

3

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

4

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

5

Boutekkouk, Fateh. "Real Time Scheduling Optimization." Journal of Information Technology Research 12, no. 4 (2019): 132–52. http://dx.doi.org/10.4018/jitr.2019100107.

Full text

Abstract:

This article deals with real time embedded multiprocessor systems scheduling optimization using conventional and quantum inspired genetic algorithms. Real time scheduling problems are known to be NP-hard. In order to resolve it, researchers have resorted to meta-heuristics instead of exact methods. Genetic algorithms seem to be a good choice to solve complex, non-linear, multi-objective and multi-modal problems. However, conventional genetic algorithms may consume much time to find good solutions. For this reason, to minimize the mean response time and the number of tasks missing their deadlin

APA, Harvard, Vancouver, ISO, and other styles

6

Holagundi, Nirmala, Girijamma Hollalkere Ashwathsetty, and Mustafa Basthikodi. "Algorithm fuzzy scheduling (AFS) for realtime jobs on multiprocessor systems." Indonesian Journal of Electrical Engineering and Computer Science 25, no. 3 (2022): 1308. http://dx.doi.org/10.11591/ijeecs.v25.i3.pp1308-1319.

Full text

Abstract:

The computing in Real-time is rapidly focusing much developments in technologies so that the real-time jobs are to be scheduled and executed on computing systems in particular time frame. The scheduling and load balancing techniques in distributed systems face numerous challenges because of lack of centralized strategy to dispatch the jobs in multiprocessors systems. In this work, we propose an Algorithm Fuzzy Scheduling (AFS) for real-time jobs that includes of Arrival time, Deadline and Computation time as the scheduling parameters of input. The approach AFS is analyzed and compared with Exi

APA, Harvard, Vancouver, ISO, and other styles

7

Shah, Apurva, and Ketan Kotecha. "ACO Based Dynamic Scheduling Algorithm for Real-Time Multiprocessor Systems." International Journal of Grid and High Performance Computing 3, no. 3 (2011): 20–30. http://dx.doi.org/10.4018/jghpc.2011070102.

Full text

Abstract:

The Ant Colony Optimization (ACO) algorithms are computational models inspired by the collective foraging behavior of ants. The ACO algorithms provide inherent parallelism, which is very useful in multiprocessor environments. They provide balance between exploration and exploitation along with robustness and simplicity of individual agent. In this paper, ACO based dynamic scheduling algorithm for homogeneous multiprocessor real-time systems is proposed. The results obtained during simulation are measured in terms of Success Ratio (SR) and Effective CPU Utilization (ECU) and compared with the r

APA, Harvard, Vancouver, ISO, and other styles

8

Bokhari, Tayyaba, Sajjad Haider Shami, and Farhan Haseeb. "Thermal Analysis of Fair Scheduling in Real-time Embedded Systems." International Journal of Reconfigurable and Embedded Systems (IJRES) 7, no. 1 (2018): 48. http://dx.doi.org/10.11591/ijres.v7.i1.pp48-56.

Full text

Abstract:

Over the past few decades, increased demand of highly sophisticated real-time applications with complex functionalities has directly led to exponentially increased power consumption and significantly elevated system temperatures. These elevated temperature and thermal variations present formidable challenges towards system reliability, performance, cooling cost and leakages. This article explores the thermal management strength of two fairness based algorithms, namely Proportional Fair (PFair) and Deadline Partitioning Fair (DP-Fair). In related literature, the introduction of fairness is ofte

APA, Harvard, Vancouver, ISO, and other styles

9

Chaudhuri, Pranay, and Jeffrey Elcock. "Process Scheduling in Heterogeneous Multiprocessor Systems Using Task Duplication." International Journal of Business Data Communications and Networking 6, no. 1 (2010): 58–69. http://dx.doi.org/10.4018/jbdcn.2010010104.

Full text

Abstract:

Scheduling tasks in heterogeneous parallel and distributed computing environments continues to be a challenging problem. In this paper, the authors investigate the Heterogeneous Earliest Finish Time (HEFT) algorithm, along with alternative scheduling policies for task prioritising phases and the Critical Path on a Processor (CPOP) for scheduling tasks on a heterogeneous multiprocessor system. The authors show that by combining the HEFT algorithm selection policy with the task duplication strategy, it is possible to further reduce the schedule length produced by both HEFT and CPOP. The process

APA, Harvard, Vancouver, ISO, and other styles

10

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

11

Ramamritham, K., J. A. Stankovic, and P. F. Shiah. "Efficient scheduling algorithms for real-time multiprocessor systems." IEEE Transactions on Parallel and Distributed Systems 1, no. 2 (1990): 184–94. http://dx.doi.org/10.1109/71.80146.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

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

13

Xu, Cheng, and Tao Li. "Chemical Reaction Optimization for Task Mapping in Heterogeneous Embedded Multiprocessor Systems." Advanced Materials Research 712-715 (June 2013): 2604–10. http://dx.doi.org/10.4028/www.scientific.net/amr.712-715.2604.

Full text

Abstract:

With different task mapping and scheduling will lead to different time consumption and energy consumption on heterogeneous multiprocessor systems, using appropriate task mapping and scheduling algorithms can save more energy. In this paper, we propose a new method to solve the task mapping problem. The algorithm consists of two elements: An intelligent approach to assign the execution orders of tasks by task level, and an allocation algorithm based on chemical-reaction-inspired metaheuristic called Chemical Reaction Optimization (CRO) to map processors to tasks. The results show that it can us

APA, Harvard, Vancouver, ISO, and other styles

14

Habibah, Ismail, N. A. Jawawi Dayang, Ahmedy Ismail, and Isa Mohd Adham. "Evaluation of the Proposed Hybrid Multiprocessor Real-Time Scheduling Approach with Partitioned and Global Approaches." MATEC Web of Conferences 255 (2019): 05004. http://dx.doi.org/10.1051/matecconf/201925505004.

Full text

Abstract:

Generally, multiprocessor real-time scheduling algorithm fall into two basic approaches, partitioned and global. The hybrid solution that we proposed applies the partitioned scheduling approach to the task set until all processors have been filled. The remaining tasks are then scheduled using the global scheduling approach. The idea of a hybrid scheduling approach to ameliorate limitations of partitioned and global approaches. Studies have shown that most prior research on hybrid multiprocessor real-time scheduling has been confined to hard and soft real-time tasks. In fact, the implementation

APA, Harvard, Vancouver, ISO, and other styles

15

Kai, Munenori, Hironori Kasahara, Seinosuke Narita, and Hitoshi Ukaji. "Task scheduling algorithms for multiprocessor real-time control systems." Electrical Engineering in Japan 107, no. 2 (1987): 120–30. http://dx.doi.org/10.1002/eej.4391070213.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Baciu, Marian D., Eugenia A. Capota, Cristina S. Stângaciu, Daniel-Ioan Curiac, and Mihai V. Micea. "Multi-Core Time-Triggered OCBP-Based Scheduling for Mixed Criticality Periodic Task Systems." Sensors 23, no. 4 (2023): 1960. http://dx.doi.org/10.3390/s23041960.

Full text

Abstract:

Mixed criticality systems are one of the relatively new directions of development for the classical real-time systems. As the real-time embedded systems become more and more complex, incorporating different tasks with different criticality levels, the continuous development of mixed criticality systems is only natural. These systems have practically entered every field where embedded systems are present: avionics, automotive, medical systems, wearable devices, home automation, industry and even the Internet of Things. While scheduling techniques have already been proposed in the literature for

APA, Harvard, Vancouver, ISO, and other styles

17

Das, Leena, Sourav Mohapatra, and Durga Prasad Mohapatra. "Schedulability of Rate Monotonic Algorithm using Improved Time Demand Analysis for Multiprocessor Environment." International Journal of Electrical and Computer Engineering (IJECE) 8, no. 1 (2018): 429. http://dx.doi.org/10.11591/ijece.v8i1.pp429-440.

Full text

Abstract:

<p>Real-Time Monotonic algorithm (RMA) is a widely used static priority scheduling algorithm. For application of RMA at various systems, it is essential to determine the system’s feasibility first. The various existing algorithms perform the analysis by reducing the scheduling points in a given task set. In this paper we propose a schedubility test algorithm, which reduces the number of tasks to be analyzed instead of reducing the scheduling points of a given task. This significantly reduces the number of iterations taken to compute feasibility. This algorithm can be used along with the

APA, Harvard, Vancouver, ISO, and other styles

18

Barketau, M. S., M. Y. Kovalyov, J. Węglarz, and M. Machowiak. "Scheduling arbitrary number of malleable tasks on multiprocessor systems." Bulletin of the Polish Academy of Sciences Technical Sciences 62, no. 2 (2014): 255–61. http://dx.doi.org/10.2478/bpasts-2014-0025.

Full text

Abstract:

Abstract The problem of scheduling n tasks in a multiprocessor system with m processors to minimize the makespan is studied. Tasks are malleable, which means that a task can be executed by several processors at a time, its processing speed depends on the number of allocated processors, and a set of processors allocated to the same task can change over time. The processing speed of a task is a strictly increasing function of the number of processors allocated to this task. The earlier studies considered the case n ≤ m. This paper presents results for arbitrary n and m including characterization

APA, Harvard, Vancouver, ISO, and other styles

19

Awadalla, Medhat H. A. "Hybrid Scheduling Scheme for Real Time Systems." INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY 15, no. 6 (2016): 6838–49. http://dx.doi.org/10.24297/ijct.v15i6.1584.

Full text

Abstract:

Systems as asymmetric multiprocessor platforms are considered power-efficient multiprocessor architectures, efficient task partitioning (assignment) and play a crucial role in achieving more energy efficiency at these multiprocessor platforms. This paper addresses the problem of energy-aware static partitioning of periodic real time tasks on heterogeneous multiprocessor platforms. A hybrid approach of Particle Swarm Optimization variant and priority assignment based Min-Min algorithm for task partitioning is proposed. The proposed approach aims to minimize the overall energy consumption, meanw

APA, Harvard, Vancouver, ISO, and other styles

20

Sarathambekai, S., and K. Umamaheswari. "Intelligent discrete particle swarm optimization for multiprocessor task scheduling problem." Journal of Algorithms & Computational Technology 11, no. 1 (2016): 58–67. http://dx.doi.org/10.1177/1748301816665521.

Full text

Abstract:

Discrete particle swarm optimization is one of the most recently developed population-based meta-heuristic optimization algorithm in swarm intelligence that can be used in any discrete optimization problems. This article presents a discrete particle swarm optimization algorithm to efficiently schedule the tasks in the heterogeneous multiprocessor systems. All the optimization algorithms share a common algorithmic step, namely population initialization. It plays a significant role because it can affect the convergence speed and also the quality of the final solution. The random initialization i

APA, Harvard, Vancouver, ISO, and other styles

21

M. Saad, E., H. A. Keshk, M. A. Saleh, and A. A. Hamam. "SCHEDULING REAL-TIME TASKS IN MULTIPROCESSOR SYSTEMS USING GENETIC ALGORITHMS." JES. Journal of Engineering Sciences 37, no. 3 (2009): 691–98. http://dx.doi.org/10.21608/jesaun.2009.126495.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Wu, Jian Lang, Jing Kai Shi, and Yi Bin Wang. "Analysis on Scheduling Algorithms of Real-Time Hybrid Tasks." Applied Mechanics and Materials 644-650 (September 2014): 2253–57. http://dx.doi.org/10.4028/www.scientific.net/amm.644-650.2253.

Full text

Abstract:

In real-time systems, periodic tasks and aperiodic tasks exist simultaneously. In a uniprocessor system, mainly there are Deferrable Server algorithm (DS) [1], Slack Stealing algorithm (SSA) [2] and their extended version for software/hardware hybrid real-time task scheduling. DS algorithm sets a high priority periodic task server to provide services for aperiodic tasks, while SSA algorithm computes tasks unoccupied time offline, and then schedule aperiodic tasks during the unoccupied period. The two algorithms are both proposed for soft real-time tasks, reducing the response time of the real-

APA, Harvard, Vancouver, ISO, and other styles

23

Furugyan, M. G. "Some algorithms of solving minimax multiprocessor scheduling problem." Journal of Computer and Systems Sciences International 53, no. 2 (2014): 195–200. http://dx.doi.org/10.1134/s1064230714020087.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

MAHESH, S., C. SIVA RAM MURTHY, and C. PANDU RANGAN. "PERFORMANCE BOUNDS FOR STATIC MULTIPROCESSOR SCHEDULING OF MULTI-TASK JOBS." Parallel Processing Letters 05, no. 03 (1995): 343–55. http://dx.doi.org/10.1142/s0129626495000321.

Full text

Abstract:

Job scheduling on multiprocessor systems is studied here as a special case of oriented two-dimensional orthogonal bin packing. Each job has subtasks which can be processed in parallel, requiring multiple processors to be allocated to each job. Then each job corresponds to a rectangle with sides equal to the processor requirement and the processing time. We study two classes of algorithms: (i) Longest processing time first (LPT) algorithms, and (ii) Largest processor requirement first (LPR) algorithms. We obtain improved asymptotic upper bounds for these algorithms compared to the bounds of the

APA, Harvard, Vancouver, ISO, and other styles

25

Garshasbi, Mohammad Sadeq. "High Performance Scheduling in Parallel Heterogeneous Multiprocessor Systems Using Evolutionary Algorithms." International Journal of Intelligent Systems and Applications 5, no. 11 (2013): 89–95. http://dx.doi.org/10.5815/ijisa.2013.11.10.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Zhao, Qingling, Mengfei Qu, Zonghua Gu, and Haibo Zeng. "Minimizing Stack Memory for Partitioned Mixed-criticality Scheduling on Multiprocessor Platforms." ACM Transactions on Embedded Computing Systems 21, no. 2 (2022): 1–30. http://dx.doi.org/10.1145/3506703.

Full text

Abstract:

A Mixed-Criticality System (MCS) features the integration of multiple subsystems that are subject to different levels of safety certification on a shared hardware platform. In cost-sensitive application domains such as automotive E/E systems, it is important to reduce application memory footprint, since such a reduction may enable the adoption of a cheaper microprocessor in the family. Preemption Threshold Scheduling (PTS) is a well-known technique for reducing system stack usage. We consider partitioned multiprocessor scheduling, with Preemption Threshold Adaptive Mixed-Criticality (PT-AMC) a

APA, Harvard, Vancouver, ISO, and other styles

27

Yang, Tao, and Qingxu Deng. "Global Multiprocessor Scheduling with Job Level Priority Assignment." Journal of Circuits, Systems and Computers 28, no. 12 (2019): 1950210. http://dx.doi.org/10.1142/s0218126619502104.

Full text

Abstract:

In the field of real-time multiprocessor scheduling, researchers have found that global scheduling on average results in better resource utilization than partitioned scheduling, and is more robust in the presence of timing errors. In this paper, we present a global scheduling algorithm JPA with Job-level Priority Assignment for sporadic task systems that can be viewed as a generalization of both FPS and EDF. We also introduce JPA's efficient variant, which greatly reduces the runtime overhead comparing with JPA. As will be shown by the experiments, JPA indeed exhibits much better performance t

APA, Harvard, Vancouver, ISO, and other styles

28

Eberbach, Eugeniusz, and Waldemar W. Koczkodaj. "A self-modifiable approach to scheduling and mapping algorithms in multiprocessor systems." International Journal of Computer Mathematics 59, no. 3-4 (1996): 131–50. http://dx.doi.org/10.1080/00207169608804461.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Chefranov, A. G., and V. Yu Bakenrot. "Efficiency of two classes of dynamic scheduling algorithms in multiprocessor computer systems." Cybernetics 21, no. 5 (1986): 620–23. http://dx.doi.org/10.1007/bf01074716.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Borzov, D. B., and I. I. Masyukov. "PLANNING OF DOWNLOAD PROCESSORS IN MULTIPROCESSOR SYSTEMS OF CRITICAL PURPOSE." Proceedings of the Southwest State University 22, no. 6 (2019): 168–74. http://dx.doi.org/10.21869/2223-1560-2018-22-6-168-174.

Full text

Abstract:

At present, multiprocessor systems of a critical nature are widely used. Such systems are used for tracking, aiming, observing, etc. Such tasks, as a rule, require maximizing productivity and reducing the time to solve a problem. For these purposes, the initial selection of non-dependent linear, conditional and cyclic sections of sequential programs is used [1]. This is done to release fragments of programs that can be assigned to execution on processors in such a way that during execution they exchange data with neighboring processors as little as possible. Due to this, it is possible to part

APA, Harvard, Vancouver, ISO, and other styles

31

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

32

Kitagawa, Hideo, Fumio Matsuda, Yoshiki Uchikawa, and Shuzo Hattori. "Multiprocessor scheduling algorithm with communication time." Systems and Computers in Japan 22, no. 11 (1991): 14–20. http://dx.doi.org/10.1002/scj.4690221102.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Huang, Shujuan, Tiansen Li, Zhihao Ma, Feng Xiao, and Wenjuan Zhang. "EDF-Adaptive: A New Semipartitioned Scheduling Algorithm for Multiprocessor Real-Time." Journal of Sensors 2021 (December 13, 2021): 1–13. http://dx.doi.org/10.1155/2021/6377024.

Full text

Abstract:

Most of the multiprocessor real-time scheduling algorithms follow the partitioned approach, the global approach, or the semipartitioned approach which is a hybrid of the first two by allowing a small subset of tasks to migrate. EDF-fm (Earliest Deadline First-based Fixed and Migrating) and EDF-os (Earliest Deadline First-based Optimal Semipartitioned) are semipartitioned approaches and were proposed for soft real-time sporadic task systems. Despite their desirable property that migrations are boundary-limited such as they can only occur at job boundaries, EDF-fm and EDF-os are not always optim

APA, Harvard, Vancouver, ISO, and other styles

34

Manimaran, G., Anand Manikutty, and C. Siva Ram Murthy. "DHARMA: A tool for evaluating dynamic scheduling algorithms for real-time multiprocessor systems." Journal of Systems and Software 50, no. 2 (2000): 131–49. http://dx.doi.org/10.1016/s0164-1212(99)00089-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Detti, Paolo, Alessandro Agnetis, and Gianfranco Ciaschetti. "Polynomial Algorithms for a Two-Class Multiprocessor Scheduling Problem in Mobile Telecommunications Systems." Journal of Scheduling 8, no. 3 (2005): 255–73. http://dx.doi.org/10.1007/s10951-005-6814-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Mahesh, K., G. Manimaran, C. Siva Ram Murthy, and Arun K. Somani. "Scheduling Algorithms with Fault Detection and Location Capabilities for Real-Time Multiprocessor Systems." Journal of Parallel and Distributed Computing 51, no. 2 (1998): 136–50. http://dx.doi.org/10.1006/jpdc.1998.1458.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Baek, Hyeongboo, and Jaewoo Lee. "Task-Level Re-Execution Framework for Improving Fault Tolerance on Symmetry Multiprocessors." Symmetry 11, no. 5 (2019): 651. http://dx.doi.org/10.3390/sym11050651.

Full text

Abstract:

Hard real-time systems are employed in military, aeronautics, and astronautics fields where deployed systems are susceptible to software faults that can result in functional errors. Thus, there is a need to use fault-tolerant (FT) real-time scheduling. Among the various fault-tolerant real-time scheduling techniques, re-execution has been applied widely to existing real-time systems owing to its simplicity and applicability. However, re-execution requires multiple executions of every task, and some tasks miss their deadlines owing to the prolonged execution time; therefore, it has been found t

APA, Harvard, Vancouver, ISO, and other styles

38

Paletta, Giuseppe, and Francesca Vocaturo. "A composite algorithm for multiprocessor scheduling." Journal of Heuristics 17, no. 3 (2010): 281–301. http://dx.doi.org/10.1007/s10732-010-9135-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Engin, Orhan, and Batuhan Engin. "Hybrid flow shop with multiprocessor task scheduling based on earliness and tardiness penalties." Journal of Enterprise Information Management 31, no. 6 (2018): 925–36. http://dx.doi.org/10.1108/jeim-04-2017-0051.

Full text

Abstract:

Purpose Hybrid flow shop with multiprocessor task (HFSMT) has received considerable attention in recent years. The purpose of this paper is to consider an HFSMT scheduling under the environment of a common time window. The window size and location are considered to be given parameters. The research deals with the criterion of total penalty cost minimization incurred by earliness and tardiness of jobs. In this research, a new memetic algorithm in which a global search algorithm is accompanied with the local search mechanism is developed to solve the HFSMT with jobs having a common time window.

APA, Harvard, Vancouver, ISO, and other styles

40

Y. Hamed, Ahmed, M. Kh Elnahary, and Hamdy H. El-Sayed. "Task Scheduling Optimization in Cloud Computing by Coronavirus Herd Immunity Optimizer Algorithm." International Journal of Advanced Networking and Applications 14, no. 06 (2023): 5686–95. http://dx.doi.org/10.35444/ijana.2023.14605.

Full text

Abstract:

Cloud computing is now dominant in high-performance distributed computing, offering resource polling and ondemand services over the web. So, the task scheduling problem in a cloud computing environment becomes a significant analysis space due to the dynamic demand for user services. The primary goal of scheduling tasks is to allocate tasks to processors to achieve the shortest possible makespan while respecting priority restrictions. In heterogeneous multiprocessor systems, task and schedule assignments significantly impact the system's operation. Therefore, the different processes within the

APA, Harvard, Vancouver, ISO, and other styles

41

Harkut, Dinesh G. "HW SW Co-design of Adaptive Task Scheduler for Real Time Systems." International Journal of Reconfigurable and Embedded Systems (IJRES) 5, no. 1 (2016): 59. http://dx.doi.org/10.11591/ijres.v5.i1.pp59-70.

Full text

Abstract:

In embedded system, a real-time operating system (RTOs) is often used to structure the application code and ensure that the deadlines are met by reacting on events in the environment by executing the functions within precise time. Most embedded systems are bound to real-time constraints with determinism and latency as a critical metrics. Generally RTOs are implemented in software, which in turns increases computational overheads, jitter and memory footprint which can be reduced even if not remove completely by utilizing latest FPGA technology, which enables the implementation of a full feature

APA, Harvard, Vancouver, ISO, and other styles

42

Kasahara, Hironori, Masahiko Iwata, Seinosuke Narita, and Hirofumi Fujii. "Parallel Processing of Robot Dynamics Simulation Using Optimal Multiprocessor Scheduling Algorithms." Systems and Computers in Japan 19, no. 10 (1988): 45–54. http://dx.doi.org/10.1002/scj.4690191005.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Wang, Wenle, Chengying Mao, Shuai Zhao, et al. "A Smart Semipartitioned Real-Time Scheduling Strategy for Mixed-Criticality Systems in 6G-Based Edge Computing." Wireless Communications and Mobile Computing 2021 (March 22, 2021): 1–11. http://dx.doi.org/10.1155/2021/6663199.

Full text

Abstract:

With the rapid growth of 6G communication and smart sensor technology, the Internet of Things (IoT) has attracted much attention now. In the 6G-based IoT applications on the multiprocessor platform, the partitioned scheduling has been widely applied. However, these partitioned scheduling approaches could cause system resource waste and uneven workload among processors. In this paper, a smart semipartitioned scheduling strategy (SSPS) was proposed for mixed-criticality systems (MCS) in 6G-based edge computing. Besides tasks’ acceptance rate and weighted schedulability, QoS is considered in SSPS

APA, Harvard, Vancouver, ISO, and other styles

44

Kada, Barkahoum, and Hamoudi Kalla. "An Efficient Fault-Tolerant Scheduling Approach with Energy Minimization for Hard Real-Time Embedded Systems." Cybernetics and Information Technologies 19, no. 4 (2019): 45–60. http://dx.doi.org/10.2478/cait-2019-0035.

Full text

Abstract:

Abstract In this paper, we focus on two major problems in hard real-time embedded systems fault tolerance and energy minimization. Fault tolerance is achieved via both checkpointing technique and active replication strategy to tolerate multiple transient faults, whereas energy minimization is achieved by adapting Dynamic Voltage Frequency Scaling (DVFS) technique. First, we introduce an original fault-tolerance approach for hard real-time systems on multiprocessor platforms. Based on this approach, we then propose DVFS_FTS algorithm for energy-efficient fault-tolerant scheduling of precedence-

APA, Harvard, Vancouver, ISO, and other styles

45

Manimaran, G., and C. S. R. Murthy. "An efficient dynamic scheduling algorithm for multiprocessor real-time systems." IEEE Transactions on Parallel and Distributed Systems 9, no. 3 (1998): 312–19. http://dx.doi.org/10.1109/71.674322.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Kuo, Chin-Fu, and Yung-Feng Lu. "Scheduling algorithm for parallel real-time tasks on multiprocessor systems." ACM SIGAPP Applied Computing Review 16, no. 4 (2017): 14–24. http://dx.doi.org/10.1145/3040575.3040577.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Tabba, Nabil, Reza Entezari-Maleki, and Ali Movaghar. "Reduced Communications Fault Tolerant Task Scheduling Algorithm for Multiprocessor Systems." Procedia Engineering 29 (2012): 3820–25. http://dx.doi.org/10.1016/j.proeng.2012.01.577.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Zhang, Weizhe, Boyu Song, and Enci Bai. "A Trusted Real-Time Scheduling Model for Wireless Sensor Networks." Journal of Sensors 2016 (2016): 1–8. http://dx.doi.org/10.1155/2016/8958170.

Full text

Abstract:

Heterogeneous multicore and multiprocessor systems have been widely used for wireless sensor information processing, but system energy consumption has become an increasingly important issue. To ensure the reliable and safe operation of sensor systems, the task scheduling success rate of heterogeneous platforms should be improved, and energy consumption should be reduced. This work establishes a trusted task scheduling model for wireless sensor networks, proposes an energy consumption model, and adopts the ant colony algorithm and bee colony algorithm for the task scheduling of a real-time sens

APA, Harvard, Vancouver, ISO, and other styles

49

Lee, Chung-Yee, and J. David Massey. "Multiprocessor scheduling: An extension of the MULTIFIT algorithm." Journal of Manufacturing Systems 7, no. 1 (1988): 25–32. http://dx.doi.org/10.1016/0278-6125(88)90030-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Lee Kee Goh, B. Veeravalli, and S. Viswanathan. "Design of Fast and Efficient Energy-Aware Gradient-Based Scheduling Algorithms Heterogeneous Embedded Multiprocessor Systems." IEEE Transactions on Parallel and Distributed Systems 20, no. 1 (2009): 1–12. http://dx.doi.org/10.1109/tpds.2008.55.

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!