Filters








116,419 Hits in 5.8 sec

Optimal scheduling of measurement-based parallel real-time tasks

Kunal Agrawal, Sanjoy Baruah, Pontus Ekberg, Jing Li
2020 Real-time systems  
In this work we consider a measurement-based model for parallel real-time tasks represented by the work and span parameters of directed acyclic graphs, with different bounds for nominal and overload scenarios  ...  We address the corresponding realtime scheduling problem and propose an optimal scheduling strategy with a derived tight bound on the maximum response time of a task.  ...  Introduction Task models based upon directed acyclic graphs (DAGs) are widely used for representing recurrent real-time processes in a manner that exposes their internal parallelism, thereby enabling the  ... 
doi:10.1007/s11241-020-09346-z fatcat:s4rilqys2ncozdpklfjewe62mi

Quality of Service of Grid Computing: Resource Sharing

Xian-He Sun, Ming Wu
2007 Sixth International Conference on Grid and Cooperative Computing (GCC 2007)  
We start at QoS policies, and then focus on technical issues of the enforcement of the policies and performance optimization under each policy.  ...  This study provides a classification of existing software system based on their underlying policies, a systematic understanding of QoS, and a framework for QoS of Grid computing.  ...  For task scheduling, we test the efficiency of the scheduling algorithms of the real-time service.  ... 
doi:10.1109/gcc.2007.102 dblp:conf/gcc/SunW07 fatcat:ctwnzq3mvbhnnknps3kmvnpwxu

Energy Saving Approaches for Scheduling on Parallel Systems: A Review

Sunita Kushwaha, Sanjay Kumar
2016 International Journal of Computer Applications  
Scheduling is a method by which task accesses the resources of the parallel system. It is efficient to choose such a method by which one can get optimum schedule length with less energy consumption.  ...  One of them is scheduling. Scheduling is frequently required in parallel systems (Distributed System, Embedded System and Multi -core System).  ...  Santhi Baskaran et al used linear programming and path based algorithms to save energy with optimal scheduling.  ... 
doi:10.5120/ijca2016911798 fatcat:qwvt2inypnh6nbvf7rshf5sa3y

Quantifying Energy Consumption for Practical Fork-Join Parallelism on an Embedded Real-Time Operating System

Antonio Paolillo, Paul Rodriguez, Nikita Veshchikov, Joël Goossens, Ben Rodriguez
2016 Proceedings of the 24th International Conference on Real-Time Networks and Systems - RTNS '16  
Practical experiments involving the deployment of OpenMP applications on a parallel embedded real-time operating system and power measurements on a MPSoC board through an oscilloscope probe show that intra-task  ...  We use a power-aware Fork-Join task model based on primitives of the OpenMP library, a scheduling algorithm to execute such model and a schedulability test from the literature to ensure that all timing  ...  We also thank the anonymous reviewer that pointed out the flaw in the schedulability test we used.  ... 
doi:10.1145/2997465.2997473 dblp:conf/rtns/PaolilloRVGR16 fatcat:vmdxgallprgajljbfdbkqmwtvm

Optimized Task Scheduling Algorithms in Distributed Computing: A Review

Nidhi Tyagi, Vinita Sharma
2019 International Journal of Computer Applications  
Task scheduling is performing the lead role in distributed computing with reducing cost. Various optimized task scheduling has been developed for execute the task efficiently.  ...  This paper proves that optimized task scheduling algorithms are better than traditional one's ever.  ...  Researchers have done much research in the field of distributed computing with real time system. This paper discusses some of the tasks scheduling algorithms.  ... 
doi:10.5120/ijca2019918345 fatcat:4omgputqazfunbzwspygmcdzgm

Grid harvest service: A performance system of grid computing

Ming Wu, Xian-He Sun
2006 Journal of Parallel and Distributed Computing  
GHS is based on a novel performance prediction model and a set of task scheduling algorithms. GHS supports three classes of task scheduling, single task, parallel processing and meta-task.  ...  Experimental results show that GHS provides a satisfactory solution for performance prediction and task scheduling of large applications and has a real potential.  ...  However, its scheduling algorithms are based on minimizing each individual task completion time, where minimizing each task does not necessarily lead to an optimized completion time of the whole application  ... 
doi:10.1016/j.jpdc.2006.05.008 fatcat:lbhfaa2u25b6zjcfgvr4x2fwne

Scheduling problems for parallel and distributed systems

Olga Rusanova, Alexandr Korochkin
1999 ACM SIGAda Ada Letters  
A two-pass scheduling algorithm for parallel and distributed computer systems is presented in this paper.  ...  Our algorithm can be used to increase efficiency of static and dynamic scheduling.  ...  So the maximal measure of performance is an optimization criterion of the static scheduling. Parallel program can be represented by a directed acyclic graph (DAG) called task graph.  ... 
doi:10.1145/319295.319323 fatcat:ohej57t6wvf3hlamdcmoegyzqe

Real-World Clustering for Task Graphs on Shared Memory Systems [chapter]

Alexander Herz, Chris Pinkau
2015 Lecture Notes in Computer Science  
By comparing real-world execution times of a schedule to the predicted static schedule lengths we show that the static schedule lengths are uncorrelated to the measured execution times and underestimate  ...  The soundness of the model is verified by comparing static and real-world overhead of different run-time schedulers.  ...  The base overhead γ of parallel execution (as determined by the measured execution time of two empty tasks) is subtracted from the predicted two node execution time pet general and divided by the sequential  ... 
doi:10.1007/978-3-319-15789-4_2 fatcat:py3p7purt5dldf3qpo27aitteq

Scheduling problems for parallel and distributed systems

Olga Rusanova, Alexandr Korochkin
1999 Proceedings of the 1999 annual ACM SIGAda international conference on Ada - SIGAda '99  
A two-pass scheduling algorithm for parallel and distributed computer systems is presented in this paper.  ...  Our algorithm can be used to increase efficiency of static and dynamic scheduling.  ...  So the maximal measure of performance is an optimization criterion of the static scheduling. Parallel program can be represented by a directed acyclic graph (DAG) called task graph.  ... 
doi:10.1145/319294.319323 dblp:conf/sigada/RusanovaK99 fatcat:xtglvmqhandurl3a5dcw5lwsyy

Survey and analysis on Task scheduling in Cloud environment

P. Akilandeswari, H. Srimathi, H. Srimathi
2016 Indian Journal of Science and Technology  
Objectives: In cloud environment many scheduling algorithms are available to achieve the quality of service, but the scalability of task execution increases, scheduling becomes more complex.  ...  Analysis: This paper focuses on a comparative study of static and dynamic task scheduling currently used and various researchers work on dynamic task scheduling for many applications.  ...  The processing time is updated after task completion; this kind of task-based scheduling is mostly applied for the periodic task.  ... 
doi:10.17485/ijst/2016/v9i37/102058 fatcat:3d722lgsazaovkk77xc63nftvu

Heuristics Techniques for Scheduling Problems with Reducing Waiting Time Variance [chapter]

Satyasundara Mahapatra, Rati Ranjan Dash, Sateesh K. Pradhan
2017 Heuristics and Hyper-Heuristics - Principles and Applications  
These processors are either single or parallel. One of the criteria for improving the efficiency of scheduler is waiting time variance (WTV). Minimizing the WTV of a task is a NP-hard problem.  ...  Achieving the quality of service (QoS) in a single or parallel processor by minimizing the WTV is a problem of task scheduling.  ...  measure (i.e., optimality criteria) of scheduling and contains single entry only.  ... 
doi:10.5772/intechopen.69224 fatcat:kzhxmxhrzvbqngtwl3zpxy4l4q

CPU Energy-Aware Parallel Real-Time Scheduling

Abusayeed Saifullah, Sezana Fahmida, Venkata P. Modekurthy, Nathan Fisher, Zhishan Guo, Marcus Völp
2020 Euromicro Conference on Real-Time Systems  
Existing work on real-time parallel tasks mostly focused on real-time scheduling without addressing energy consumption.  ...  These systems entail a myriad of real-time tasks, where each task itself is a parallel task that can utilize multiple computing units at the same time.  ...  We shall develop both federated and global preemptive real-time scheduling of parallel tasks for energy minimization.  ... 
doi:10.4230/lipics.ecrts.2020.2 dblp:conf/ecrts/SaifullahFMFG20 fatcat:kgkl32wlnjbahmuviueataxh5q

Energy-Efficient Multi- Core Scheduling for Real-Time Video Processing
실시간 비디오 처리에 적합한 에너지 효율적인 멀티코어 스케쥴링

Hyung-Goo Paek, Jeong-Mo Yeo, Wan-Yeon Lee
2011 Journal of the Korea Society of Computer and Information  
In this paper, we propose an optimal scheduling scheme that minimizes the energy consumption of a real-time video task on the multi-core platform supporting dynamic voltage and frequency scaling.  ...  Exploiting parallel execution on multiple cores for less energy consumption, the propose scheme allocates an appropriate number of cores to the task execution, turns off the power of unused cores, and  ...  In contrast, this paper addresses an optimal scheduling that achieves the minimal energy consumption of a real-time parallel task under practical restrictions discretely available frequencies with their  ... 
doi:10.9708/jksci.2011.16.6.011 fatcat:itynsmphincz3lztd46fnyvtia

Paving the way for multi-cores in industrial hard real-time control applications

Ralf Jahr, Martin Frieb, Mike Gerdes, Theo Ungerer, Andreas Hugl, Hans Regler
2014 Proceedings of the 9th IEEE International Symposium on Industrial Embedded Systems (SIES 2014)  
The approach is based on (a) scheduling periodic tasks onto multiple dedicated cores as well as (b) executing other code parts after a model-based parallelization, which introduces structured parallelism  ...  The approach is demonstrated and evaluated for the control code of a foundation crane; slack time is introduced as measurement for the effectiveness.  ...  The approach is based on (a) scheduling periodic tasks onto multiple dedicated cores as well as (b) executing other code parts after a model-based parallelization, which introduces structured parallelism  ... 
doi:10.1109/sies.2014.7087457 fatcat:paolo7ixdbcpxgtjakqykpghpm

Utilization Control and Optimization of Real-Time Embedded Systems

Xue Liu, Xi Chen, Fanxin Kong
2015 Foundations and Trends® in Electronic Design Automation  
For example, based on a model of task execution time, we can keep processor utilization to be under the schedulable utilization bound while still providing real-time guarantees.  ...  Scheduling Real-Time Embedded Tasks Scheduling approaches for different platforms and tasks have been extensively studied.  ... 
doi:10.1561/1000000042 fatcat:cogbfqdepneo5hb6xwcybn2u7q
« Previous Showing results 1 — 15 out of 116,419 results