5,381 Hits in 7.8 sec

A multi-DAG model for real-time parallel applications with conditional execution

José Carlos Fonseca, Vincent Nélis, Gurulingesh Raravi, Luís Miguel Pinho
2015 Proceedings of the 30th Annual ACM Symposium on Applied Computing - SAC '15  
We propose a two-step solution that computes a single synchronous DAG of servers for a task modeled by a multi-DAG and show that these servers are able to supply every execution flow of that task with  ...  We propose a two-step solution that computes a single synchronous DAG of servers for a task modeled by a multi-DAG and show that these servers are able to supply every execution flow of that task with  ...  Acknowledgments This work was partially supported by National Funds through FCT (Portuguese Foundation for Science and Technology) and by ERDF  ... 
doi:10.1145/2695664.2695808 dblp:conf/sac/FonsecaNRP15 fatcat:3ot5zeg7yfh5bc2xnu7yn7ezgu

Toward Contention Analysis for Parallel Executing Real-Time Tasks

Fabrice Guet, Luca Santinelli, Jérôme Morio, Guillaume Phavorin, Eric Jenn, Michael Wagner
2018 Worst-Case Execution Time Analysis  
A parallel execution simulator for multi-core real-time system is developed and used for validating our framework. The framework applies heuristics and assumptions that simplify the system behavior.  ...  The work focuses on the interferences on shared resources (cache memories and memory buses) from parallel executions in multi-core real-time systems.  ...  In this work, we propose a contention analysis to explore the measurements scenarios for parallel real-time applications executed within multi-core platforms.  ... 
doi:10.4230/oasics.wcet.2018.4 dblp:conf/wcet/GuetSMPJ18 fatcat:nnqbnblz3zfydeffkuolzt5xhi

2020 IEEE 26th International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA)

2020 2020 IEEE 26th International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA)  
Data distribution on a multi-GPU node for TomoBayes CT reconstruction Gill, Christopher Efficient Deterministic Federated Scheduling for Parallel Real-Time Tasks Glanon, Philippe Cyclic Scheduling of Loop-Intensive  ...  Preemption Thresholds with Limited Preemption Scheduling Foughali, Mohammed A Two-Step Hybrid Approach for Verifying Real-Time Robotic Systems Friebe, Anna Identification and Validation of Markov Models  ... 
doi:10.1109/rtcsa50079.2020.9203727 fatcat:x5bjijat5jfstn6lpgtyk7ohb4

A Measurement-Based Model for Parallel Real-Time Tasks

Kunal Agrawal, Sanjoy Baruah, Marc Herbstritt
2018 Euromicro Conference on Real-Time Systems  
In this paper we propose a model for representing parallelizable real-time tasks in a manner that permits us to do so.  ...  executing the code under different conditions and measuring the run-times.  ...  A Multi-DAG model for real-time parallel applications with conditional execution. In Proceedings of the ACM/ SIGAPP Symposium on Applied Computing (SAC), Salamanca, Spain, April 2015.  ... 
doi:10.4230/lipics.ecrts.2018.5 dblp:conf/ecrts/AgrawalB18 fatcat:gwq24dmy6rf5hemtcb6uenessi

Parallel Real-Time Tasks, as Viewed by WCET Analysis and Task Scheduling Approaches

Christine Rochange, Marc Herbstritt
2016 Worst-Case Execution Time Analysis  
With the advent of multi-core platforms, research in the field of hard real-time has recently considered parallel software, from the perspective of both worst-case execution time (WCET) and task schedulability  ...  This paper draws a brief overview of the state of the art in the timing analysis of parallel tasks and tries to identify points of convergence and divergence between the existing approaches.  ...  The author would like to thank the organizers, the speakers and the participants of the Optimizing Real-Time Systems workshop on Parallelization of real-time tasks 1 : they have inspired this paper.  ... 
doi:10.4230/oasics.wcet.2016.11 dblp:conf/wcet/Rochange16 fatcat:5w6jmrqjdzbylkgn7kind5o6mm

Sw/Hw Partitioning and Scheduling on Region-Based Dynamic Partial Reconfigurable System-on-Chip

Qi Tang, Biao Guo, Zhe Wang
2020 Electronics  
Therefore, a multi-step hybrid method that combines graph partitioning and MILP is proposed, which is able to reduce the time complexity significantly with the solution quality being degraded marginally  ...  A set of experiments is carried out using a set of real-life applications, and the result demonstrates the effectiveness of the proposed methods.  ...  However, cMILP only produces the shortest SL for only one application, i.e., LIGO. What is more, for this application, the multi-step hybrid method produces the same result with much less time.  ... 
doi:10.3390/electronics9091362 fatcat:uktr2eehhnfutly36c24q2iloa

Parallel Scheduling of Multiple SDF Graphs onto Heterogeneous Processors

Dowhan Jeong, Jangryul Kim, Mari-Liis Oldja, Soonhoi Ha
2021 IEEE Access  
Parallel scheduling of multiple real-time applications onto heterogeneous processors is needed in the emerging embedded systems such as self-driving cars, smart cameras, and smartphones.  ...  In each iteration, we use an existing worst-case response time (WCRT) analysis tool to check if all applications satisfy their real-time requirements by translating each SDF graph into a directed acyclic  ...  EXPERIMENTS A. BENCHMARKS AND SET-UP For experiments, we select five real-life applications specified with an SDF graph or a multi-mode SDF graph, as displayed in Table 5 .  ... 
doi:10.1109/access.2021.3054725 fatcat:z6l46jgsvbgidkda77tlfq2hly

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.  ...  While meeting all real-time constraints, we try to identify the best task allocation and execution pattern such that the average power consumption of the whole platform is minimized.  ...  for Real-Time DAG Tasks with implicit deadlines.  ... 
doi:10.4230/lipics.ecrts.2017.22 dblp:conf/ecrts/GuoBSGX17 fatcat:bi5jiiiwuvda3llevn62moq33u

Bind: a Partitioned Global Workflow Parallel Programming Model [article]

Alex Kosenkov, Matthias Troyer
2016 arXiv   pre-print
To address this challenge, we present Bind: a "partitioned global workflow" parallel programming model for C++ applications that enables quick prototyping and agile development cycles for high performance  ...  We present applications of Bind to Linear Algebra and MapReduce algorithms alongside with performance results.  ...  Multi-version concurrency The construction of the DAG used as a basis for the parallel execution is by no means a trivial task.  ... 
arXiv:1606.04830v1 fatcat:6knujtlce5amnczddui2jysiua

PkMin: Peak Power Minimization for Multi-Threaded Many-Core Applications

Arka Maity, Anuj Pathania, Tulika Mitra
2020 Journal of Low Power Electronics and Applications  
The application comes with a hard deadline and high peak power consumption. Parallel execution of multiple tasks on multiple cores results in a quicker execution, but higher peak power.  ...  All previous works on peak power minimization for many-core applications (with or without DAG) assume only single-threaded tasks.  ...  System Model: we need to execute an application with M ∈ N multi-threaded tasks indexed while using i on a many-core with N ∈ N cores.  ... 
doi:10.3390/jlpea10040031 fatcat:do4nys5pk5gutolepgxakyuahq

High-Performance and Time-Predictable Embedded Computing [chapter]

Luis Miguel Pinho, Eduardo Quinones, Marko Bertogna, Andrea Marongiu, Vincent Nélis, Paolo Gai, Juan Sancho
2018 High-Performance and Time-Predictable Embedded Computing  
This chapter motivates the use of the OpenMP (Open Multi-Processing) parallel programming model to develop future critical real-time embedded systems, and analyzes the time-predictable properties of the  ...  Overall, the task of developing applications with Pthreads is very hard.  ...  Overall, the DAG represents the main formalism to capture the properties of a real-time application.  ... 
doi:10.13052/rp-9788793609624 fatcat:k7s3qrikfrclffppj2n2qjk4ny

An Analysis of Lazy and Eager Limited Preemption Approaches under DAG-Based Global Fixed Priority Scheduling

Maria A. Serrano, Alessandra Melani, Sebastian Kehr, Marko Bertogna, Eduardo Quinones
2017 2017 IEEE 20th International Symposium on Real-Time Distributed Computing (ISORC)  
DAG-based scheduling models have been shown to effectively express the parallel execution of current many-core heterogeneous architectures.  ...  We evaluate our analysis with both, synthetic DAG-based task-sets and a real case-study from the automotive domain.  ...  CONCLUSIONS With the advent of multi-and many-core embedded processors, DAG-based scheduling models are gaining a lot of attention due to its capability to effectively model the parallel execution.  ... 
doi:10.1109/isorc.2017.9 dblp:conf/isorc/SerranoMKBQ17 fatcat:de6wmpzw7vbmxf7kfpynlayhqe

Parallel Real-Time Scheduling of DAGs

Abusayeed Saifullah, David Ferry, Jing Li, Kunal Agrawal, Chenyang Lu, Christopher Gill
2014 IEEE Transactions on Parallel and Distributed Systems  
In this paper, we address the problem of real-time scheduling for a general model of deterministic parallel tasks, where each task is represented as a directed acyclic graph (DAG) with nodes having arbitrary  ...  We prove processor-speed augmentation bounds for both preemptive and non-preemptive real-time scheduling for general DAG tasks on multi-core processors.  ...  The decomposition in [6] for restrictive model is not applicable for general DAG.  ... 
doi:10.1109/tpds.2013.2297919 fatcat:5rvxwihg3bgitne2xumwepjnkq

SOLIS – The MLOps journey from data acquisition to actionable insights [article]

Razvan Ciobanu, Alexandru Purdila, Laurentiu Piciu, Andrei Damian
2022 arXiv   pre-print
Being able to define very clear hypotheses for actual real-life problems that can be addressed by machine learning models, collecting and curating large amounts of data for model training and validation  ...  Automating live configuration mechanisms, on the fly adapting to live or offline data capture and consumption, serving multiple models in parallel either on edge or cloud architectures, addressing specific  ...  be used due to the multi-processing approach with no real impediments on using "competing" tensor frameworks in parallel.  ... 
arXiv:2112.11925v2 fatcat:bgkdomsm3rcmzn2x6bmzmppdmq

Critical-Path-First based allocation of real-time streaming applications on 2D mesh-type multi-cores

Hazem Ismail Abdel Aziz Ali, Luis Miguel Pinho, Benny Akesson
2013 2013 IEEE 19th International Conference on Embedded and Real-Time Computing Systems and Applications  
This work addresses this problem by proposing a new heuristic algorithm, Critical-Path-First, for the allocation of realtime streaming applications modeled as dataflow graphs on 2D mesh multi-core processors  ...  Designing cost-efficient multi-core real-time systems requires efficient techniques to allocate applications to cores while satisfying their timing constraints.  ...  ACKNOWLEDGMENT This work was partially supported by National Funds through FCT (Portuguese Foundation for Science and Technology) and by ERDF (European Regional Development  ... 
doi:10.1109/rtcsa.2013.6732220 dblp:conf/rtcsa/AliPA13 fatcat:zzv6sscdbrcotbsuhxktgxwjbm
« Previous Showing results 1 — 15 out of 5,381 results