Filters








9,873 Hits in 7.2 sec

Partitioned Real-time Scheduling on Heterogeneous Shared-Memory Multiprocessors

Martin Niemeier, Andreas Wiese, Sanjoy Baruah
2011 2011 23rd Euromicro Conference on Real-Time Systems  
These include (i) scheduling a collection of implicit-deadline sporadic tasks with the objective of meeting all deadlines; and (ii) scheduling a collection of independent jobs with the objective of minimizing  ...  We consider several real-time scheduling problems on heterogeneous multiprocessor platforms, in which the different processors share a common memory pool.  ...  In addition, these results have immediate applicability for the scheduling of certain kinds of frame-based recurrent real-time systems, in which the recurrent nature of the behavior is expressed as the  ... 
doi:10.1109/ecrts.2011.19 dblp:conf/ecrts/NiemeierWB11 fatcat:mtvw3e4l6jazjcshmpxf6c4bmy

Guest editorial: multiprocessor scheduling

Alan Burns, Laurent George
2013 Real-time systems  
In the context of real-time systems, it is not sufficient to prove the correctness of applications in term of results but also that those results are delivered in time.  ...  New scheduling approaches  ...  New design techniques, scheduling approaches, real-time analysis methods and real-time operating systems have to be developed.  ... 
doi:10.1007/s11241-013-9177-1 fatcat:llviqg6ukjh77lybys7a2girsa

Fixed-Priority Multiprocessor Scheduling: Critical Instant, Response Time and Utilization Bound

Nan Guan, Wang Yi
2012 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum  
The rapid development of multi-core processors leads to a constantly increasing trend of deploying real-time systems on multi-core platforms, to satisfy the dramatically increasing high-performance and  ...  This trend demands effective and efficient multiprocessor real-time scheduling techniques. The uniprocessor scheduling problem has been well studied during the last 40 years.  ...  A real-time system typically consists of multiple recurrent processes. These recurrent processes may be invoked with different periods (different frequencies).  ... 
doi:10.1109/ipdpsw.2012.305 dblp:conf/ipps/GuanY12 fatcat:hw33v33szbbddixy7aaqi4oe5a

A Formal Approach to Design and Verification of Two-Level Hierarchical Scheduling Systems [chapter]

Laura Carnevali, Giuseppe Lipari, Alessandro Pinzuti, Enrico Vicario
2011 Lecture Notes in Computer Science  
conformance testing of the real-time code.  ...  Hierarchical scheduling (HS) systems manage a set of realtime applications through a scheduling hierarchy, enabling partitioning and reduction of complexity, confinement of failure modes, and temporal  ...  According to this, each task of the specification is implemented through: i) a recurrent real-time task that performs job releases by signaling a semaphore at each activation, and ii) a further real-time  ... 
doi:10.1007/978-3-642-21338-0_9 fatcat:k42vc52pabbe7fb6sax55slucy

Design and Implementation of Task Reprocessing on Medium-large Multi-core Architecture

PAVAN KUMAR PARUCHURI, Satyanarayana CH, Ananda Rao A, Radica Raju P
2017 Application and Theory of Computer Technology  
EDF-Based real-time scheduling approach is one of the efficient way of scheduling the recurrent real-time tasks in both soft real-time and hard real-time systems.  ...  We also discuss the implementation and experimental evaluation of Task-Repo procedure for co-scheduling task sets, under the utilization of 50-60% (per-task) on small to medium-large multicore LINUX SYSTEM  ...  Srinivasa Reddy, and Teja santosh of GITAM University, Hyderabad.  ... 
doi:10.22496/atct.v2i3.80 fatcat:uhqlafmdi5ggdjexwkvyxujhv4

Redoop infrastructure for recurring big data queries

Chuan Lei, Zhongfang Zhuang, Elke A. Rundensteiner, Mohamed Y. Eltabakh
2014 Proceedings of the VLDB Endowment  
Redoop employs innovative window-aware optimization techniques for such recurring workloads including adaptive window-aware data partitioning, cache-aware task scheduling, and inter-window caching mechanisms  ...  Recurring queries, repeatedly being executed for long periods of time over evolving high-volume data, have become a bedrock component in most large-scale data analytic applications.  ...  Execution Profiler collects the statistics after the completion of each query recurrence, i.e., execution times of previous query recurrences.  ... 
doi:10.14778/2733004.2733037 fatcat:cqmbdmqbzrh2ffuq47ar6ty5xy

Towards an OpenMP Specification for Critical Real-Time Systems [chapter]

Maria A. Serrano, Sara Royuela, Eduardo Quiñones
2018 Lecture Notes in Computer Science  
This paper analyzes the challenges of combining the concurrency model of real-time tasks with the parallel model of OpenMP.  ...  OpenMP allows exploiting the parallelism exposed within real-time tasks and among them.  ...  Acknowledgments The research leading to these results has received funding from the Spanish Ministry of Science and Innovation, under contract TIN2015-65316-P, and from the European Union's Horizon 2020  ... 
doi:10.1007/978-3-319-98521-3_10 fatcat:t4w3j6hxlbdw5cstpb4y5tkqkq

Efficient Parallelization of Complex Automotive Systems

Julian Kienberger, Christian Saad, Stefan Kuntz, Bernhard Bauer
2016 Proceedings of the 7th International Workshop on Programming Models and Applications for Multicores and Manycores - PMAM'16  
This is largely due to the elaborate parallelization process (partitioning, mapping and scheduling software parts as tasks on different cores) that results in a combinatorial explosion and thus spans a  ...  well as initial task-to-core mappings.  ...  Acknowledgments We would like to cordially thank the Timing-Architects Embedded Systems GmbH for giving us the opportunity to use their software within TA research partner program.  ... 
doi:10.1145/2883404.2883421 dblp:conf/ppopp/KienbergerSKB16 fatcat:5i6p6spykrhy7gfawtxl3fvfde

Restricted tasking models

A. Burns, A. J. Wellings
1997 ACM SIGAda Ada Letters  
High-integrity systems rarely make use of high-level language features such as Ada tasking.  ...  Scheduling is undertaken as part of the application and can thus be inspected and verified. Five other models are also presented that give different levels of expressive power.  ...  Language Features Employed The Level-0 model uses the following features: library-level non-hierarchical tasks a static number of tasks the real-time clock defined in the Real Time Systems Annex -type  ... 
doi:10.1145/271658.271679 fatcat:7vcp7yjrdjheveyyztjkwkiqmi

Restricted tasking models

A. Burns, A. J. Wellings
1997 ACM SIGAda Ada Letters  
High-integrity systems rarely make use of high-level language features such as Ada tasking.  ...  Scheduling is undertaken as part of the application and can thus be inspected and verified. Five other models are also presented that give different levels of expressive power.  ...  Language Features Employed The Level-0 model uses the following features: library-level non-hierarchical tasks a static number of tasks the real-time clock defined in the Real Time Systems Annex -type  ... 
doi:10.1145/271662.271679 fatcat:sojcgeh7a5e3tg3as6zfmk3hpy

Modeling and Verification of ARINC 653 Hierarchical Preemptive Scheduling

Ning Fu, Lijun Shan, Chenglie Du, Zhiqiang Liu, Han Peng
2018 ˜The œinternational Arab journal of information technology  
Avionics Application Standard Software Interface (ARINC 653) is a software specification for space and time partitioning in safety-critical avionics real-time operating systems.  ...  The method discussed modeled preemptive scheduling by using the stop/watch features of priced timed automata.  ...  Paper [14, 16] modelled recurrent real-time applications as a set of parallel Directed Acyclic Graph (DAG) tasks and analyzed the schedulability by exploring the space of all possible schedules using  ... 
doi:10.34028/iajit/17/1/12 fatcat:7tpa3uxxtzez5mnuyn27zfeiu4

Dynamic Priority Real-Time Scheduling on Power Asymmetric Multicore Processors

Basharat Mahmood, Naveed Ahmad, Majid Iqbal Khan, Adnan Akhunzada
2021 Symmetry  
We have proposed a dynamic-priority semi-partitioned algorithm named: Earliest-Deadline First with C=D Task Splitting (EDFwC=D-TS) for scheduling real-time applications on power asymmetric multicore processors  ...  Unfortunately, the research on real-time scheduling of power asymmetric multicore processors is in its infancy. In this research, we have addressed this problem and added new results.  ...  Conflicts of Interest: Authors declare no conflict of interest.  ... 
doi:10.3390/sym13081488 fatcat:iy3v6zwlsfh55jy5zgp3c5kcxm

Real-Time Support in the Proposal for Fine-Grained Parallelism in Ada

Luis Miguel Pinho, Brad Moore, Stephen Michell, S. Tucker Taft
2015 2015 IEEE Real-Time Systems Symposium  
Abstract- The Ada language has for long provided support for the development of reliable real-time systems, with a model of computation amenable for real-time analysis.  ...  The Ada language has for long provided supportfor the development of reliable real-time systems, with a modelof computation amenable for real-time analysis.  ...  REAL-TIME SUPPORT The usual model for real-time programming in Ada is where real-time tasks map one-to-one with Ada tasks.  ... 
doi:10.1109/rtss.2015.43 dblp:conf/rtss/PinhoMMT15 fatcat:mznwcuh26jbenlrjftkj6bup7i

Enhanced PSO Approach for Real Time Systems Scheduling

Medhat Awadalla, Abdullah Elewi
2016 Journal of clean energy technologies  
This paper addresses the problem of energy-aware static partitioning of periodic real time tasks on heterogeneous multiprocessor platforms.  ...  of the number of executed iterations to accomplish a specific task in addition to the energy savings.  ...  The multiprocessor scheduling of recurrent real-time tasks can be Manuscript received October 26, 2014; revised May 9, 2015.  ... 
doi:10.7763/ijcte.2016.v8.1059 fatcat:lh5icwybm5fs7crm5xpg4dox3u

A heuristic to minimize the cardinality of a real-time task set by automated task clustering

Antoine Bertout, Julien Forget, Richard Olejnik
2014 Proceedings of the 29th Annual ACM Symposium on Applied Computing - SAC '14  
We propose in this paper a method to automatically map functionalities (blocks of code corresponding to highlevel features) with real-time constraints to tasks (or threads).  ...  We aim at reducing the number of tasks functions are mapped to, while preserving the schedulability of the initial system. We consider independent tasks running on a single processor.  ...  Introduction Our work falls within the scope of real-time systems programming. Usually, real-time system developers design a system as a set of functionalities with real-time constraints.  ... 
doi:10.1145/2554850.2554958 dblp:conf/sac/BertoutFO14 fatcat:hrnlxgdphffulpcaukcpp47fu4
« Previous Showing results 1 — 15 out of 9,873 results