Filters








3,564 Hits in 5.6 sec

Assigning sporadic tasks to unrelated machines

Alberto Marchetti-Spaccamela, Cyriel Rutten, Suzanne van der Ster, Andreas Wiese
2014 Mathematical programming  
We study the problem of assigning sporadic tasks to unrelated machines such that the tasks on each machine can be feasibly scheduled.  ...  Key to these results are two new relaxations of the demand bound function, the function that yields a sufficient and necessary condition for a task system on a single machine to be feasible.  ...  Conclusion In this paper we presented the first results for assigning sporadic tasks with arbitrary deadlines to unrelated parallel processors.  ... 
doi:10.1007/s10107-014-0786-9 fatcat:dyxvmgapzbbiznaywqe2qfebma

Predictability of Fixed-Job Priority Schedulers on Heterogeneous Multiprocessor Real-Time Systems [article]

Liliana Cucu-Grosjean, Joël Goossens
2009 arXiv   pre-print
Our main contribution is to show that any FJP schedulers are predictable on unrelated platforms.  ...  An important property for the schedulability analysis, the predictability (regardless to the execution times), is studied for heterogeneous multiprocessor platforms.  ...  Unrelated parallel machines In unrelated parallel machines, there is an execution rate s i,j associated with each job-processor pair, a job J i that is executed on processor π j for t time units completes  ... 
arXiv:0908.3519v1 fatcat:qwgz6oeg2jcrvpcnwmzcwpnn6q

Implementation & Performance Analysis of Real Time Scheduling Algorithms for Three Industrial Embedded Applications (IEA)

Vishal Vora
2012 International Journal of Advanced Information Technology  
Real time scheduling algorithms are mainly depending on type of task i.e. either periodic or aperiodic or sporadic.  ...  It is essential necessity of embedded system to generate response or output within deadline.  ...  ACKNOWLEDGEMENTS The authors would like to acknowledge math works incorporation, Management and R &D Team of Orpat Pvt. Ltd, India for providing required infrastructure for this work.  ... 
doi:10.5121/ijitcs.2012.2601 fatcat:5tulrevslngmrauujomd527nny

Energy-Efficient Multi-Core Scheduling for Real-Time DAG Tasks

Zhishan Guo, Ashikahmed Bhuiyan, Abusayeed Saifullah, Nan Guan, Haoyi Xiong, Marc Herbstritt
2017 Euromicro Conference on Real-Time Systems  
In this work, we study energy-aware real-time scheduling of a set of sporadic Directed Acyclic Graph (DAG) tasks with implicit deadlines.  ...  To the best of our knowledge, this is the first work that addresses the power consumption issue in scheduling multiple DAG tasks on multi-cores and allows intra-task processor sharing.  ...  Background and System Model We consider a multi-core platform of m identical cores to schedule a set of sporadic parallel tasks.  ... 
doi:10.4230/lipics.ecrts.2017.22 dblp:conf/ecrts/GuoBSGX17 fatcat:bi5jiiiwuvda3llevn62moq33u

Scheduling in Heterogeneous Computing Environments for Proximity Queries

Duksu Kim, Jinkyu Lee, Junghwan Lee, Insik Shin, John Kim, Sung-Eui Yoon
2013 IEEE Transactions on Visualization and Computer Graphics  
OVERVIEW We give a background on hierarchy-based proximity computation and then describe our hybrid parallel framework.  ...  ., 75%) to the performance provided by a conservative upper bound of the ideal throughput.  ...  ACKNOWLEDGMENT We would like to thank anonymous reviewers for their constructive feedbacks. We also thank Kee-Eung Kim and members of SGLab. for their supports.  ... 
doi:10.1109/tvcg.2013.71 pmid:23846096 fatcat:gsgz3rxuajfzvoqt3xgc3bobfm

Scheduling independent tasks on multi-cores with GPU accelerators

Raphael Bleuse, Safia Kedad-Sidhoum, Florence Monna, Grégory Mounié, Denis Trystram
2014 Concurrency and Computation  
We present in this paper a new method for scheduling efficiently parallel applications with m CPUs and k GPUs, where each task of the application can be processed either on a core (CPU) or on a GPU.  ...  Then, we present a faster approximation algorithm for a special case of the previous problem, where all the tasks are accelerated when affected to GPU, with a performance guarantee of 3 2 for any number  ...  Another direction is to consider the problem of scheduling on unrelated machines of few different types.  ... 
doi:10.1002/cpe.3359 fatcat:bcxl4afcj5avhok5sb4kzr2m64

Scheduling Independent Tasks on Multi-cores with GPU Accelerators [chapter]

Safia Kedad-Sidhoum, Florence Monna, Grégory Mounié, Denis Trystram
2014 Lecture Notes in Computer Science  
We present in this paper a new method for scheduling efficiently parallel applications with m CPUs and k GPUs, where each task of the application can be processed either on a core (CPU) or on a GPU.  ...  Then, we present a faster approximation algorithm for a special case of the previous problem, where all the tasks are accelerated when affected to GPU, with a performance guarantee of 3 2 for any number  ...  Another direction is to consider the problem of scheduling on unrelated machines of few different types.  ... 
doi:10.1007/978-3-642-54420-0_23 fatcat:x6dnunhyv5g6jognvwddepf3om

Gene Expression Classification with a Novel Coevolutionary Based Learning Classifier System on Public Clouds

Christian Vecchiola, Mani Abedini, Michael Kirley, Xingchen Chu, Rajkumar Buyya
2010 2010 Sixth IEEE International Conference on e-Science Workshops  
Consequently, there is a need to investigate new, robust machine learning techniques capable of accurately classifying microarray data.  ...  In this paper, we present a coevolutionary learning classifier system based on feature set partitioning to classify gene expression data.  ...  The Task Model provides a very simple set of abstractions that allows developers to define a sequence of unrelated tasks that do not have precedence or sequencing constraints.  ... 
doi:10.1109/esciencew.2010.24 fatcat:zn6i7x422jg67dvbga2ujo5uye

Scheduling (Dagstuhl Seminar 16081)

Nikhil Bansal, Nicole Megow, Clifford Stein, Marc Herbstritt
2016 Dagstuhl Reports  
We consider two related scheduling problems: resource constrained scheduling on identical parallel machines and a generalization with resource dependent processing times.  ...  We present a method to obtain asymptotic fully polynomial approximation schemes (AFPTAS) for the problems.  ...  However, this may completely disrupt the current assignment of jobs to machines.  ... 
doi:10.4230/dagrep.6.2.97 dblp:journals/dagstuhl-reports/BansalMS16 fatcat:7yjnnvu26vcjfa3r6nknvrpkk4

Assigning real-time tasks on heterogeneous multiprocessors with two unrelated types of processors

Gurulingesh Raravi, Björn Andersson, Konstantinos Bletsas
2012 Real-time systems  
, compared to an optimal task assignment algorithm.  ...  Consider the problem of partitioned scheduling of an implicit-deadline sporadic task set on heterogeneous multiprocessors to meet all deadlines. Each processor is either of type-1 or type-2.  ...  It is a well-known fact that the problem under consideration is equivalent to the problem of minimizing the makespan on unrelated machines.  ... 
doi:10.1007/s11241-012-9161-1 fatcat:ucbvnvz57zfohfektkkabaj2mq

Assigning Real-Time Tasks on Heterogeneous Multiprocessors with Two Unrelated Types of Processors

Bjorn Andersson, Gurulingesh Raravi, Konstantinos Bletsas
2010 2010 31st IEEE Real-Time Systems Symposium  
, compared to an optimal task assignment algorithm.  ...  Consider the problem of partitioned scheduling of an implicit-deadline sporadic task set on heterogeneous multiprocessors to meet all deadlines. Each processor is either of type-1 or type-2.  ...  It is a well-known fact that the problem under consideration is equivalent to the problem of minimizing the makespan on unrelated machines.  ... 
doi:10.1109/rtss.2010.32 dblp:conf/rtss/AnderssonRB10 fatcat:7hpw3ghaxvdt5iwhnl2rlvzefi

Gang FTP scheduling of periodic and parallel rigid real-time tasks [article]

Joël Goossens, Vandy Berten
2010 arXiv   pre-print
Moreover, we extend the definition of rigid, moldable and malleable jobs to recurrent tasks.  ...  In this paper we consider the scheduling of periodic and parallel rigid tasks.  ...  A periodic/sporadic task is said to be:Rigid if all its jobs are rigid, and the number of processors assigned to the jobs is specified externally to the scheduler;Moldable if all its jobs are moldable;  ... 
arXiv:1006.2617v1 fatcat:diz7xedybfbddmjkglfyqhlvfy

Real-time scheduling with resource sharing on heterogeneous multiprocessors

Björn Andersson, Gurulingesh Raravi
2014 Real-time systems  
In a t-type heterogeneous multiprocessor platform (also called unrelated parallel machine) (i) not all processors are of the same type, (ii) the execution time of a task depends on the type of processor  ...  Consider the problem of scheduling a task set τ of implicit-deadline spo-radic tasks to meet all deadlines on a t-type heterogeneous multiprocessor platform where tasks may access multiple shared resources  ...  For convenience, let LP-EE-δ-cp denote such a task assignment policy, i.e., using LP-EE-δ to assign phase-A subtasks and 'copying' the assignment for respective phase-C subtasks.  ... 
doi:10.1007/s11241-013-9195-z fatcat:suoss5yvvzcmrdv6blamvs3juu

Application Mapping [chapter]

Peter Marwedel
2021 Embedded Systems  
We need to map applications both to processors and to particular execution times. This is feasible with appropriate scheduling techniques.  ...  Taking as many scheduling decisions as reasonable at design time enables us to provide timing guarantees.  ...  . , π m } are unrelated.  ... 
doi:10.1007/978-3-030-60910-8_6 fatcat:js6u4244mjgvlnbycd5ztc37q4

Automatic Generation of Timing Models for Timing Analysis of High-Level Code

Peter Altenbernd, Andreas Ermedahl, Björn Lisper, Jan Gustafsson
2011 International Conference on Real-Time and Network Systems  
In previous work, we have found that GPUs may be integrated into real-time systems through the treatment of GPUs as shared resources, allocated to real-time tasks through mutual exclusion locking protocols  ...  This protocol may be used to manage a pool of GPU resources in such systems.  ...  ACKNOWLEDGMENTS We would like to thank Alejandro Masrur for his useful comments on a preliminary version of this paper and Jai Dhariwal for proofreading.  ... 
dblp:conf/rtns/AltenberndELG11 fatcat:gh4qe3npgfg4ncejm53oqo75py
« Previous Showing results 1 — 15 out of 3,564 results