Filters








629 Hits in 3.9 sec

Implications of classical scheduling results for real-time systems

J.A. Stankovic, M. Spuri, M. Di Natale, G.C. Buttazzo
1995 Computer  
Important classical scheduling theory results for real-time computing are identi ed. Implications of these results from the perspective of a real-time systems designer are discussed.  ...  Every real-time systems designer should be familiar with a set of important classical scheduling theory results, i.e., those results largely taken from the literature in complexity theory and operations  ...  forms of real-time multiprocessing scheduling, i.e., P j pmtn j X U j where U j are the late tasks, requires heuristics.  ... 
doi:10.1109/2.386982 fatcat:pgdsgkk5mbhzra4bud4w5fxerq

Adaptive Optimizations for Stream-based Workflows

Liang Liang, Rosa Filguiera, Yan Yan
2020 2020 IEEE/ACM Workflows in Support of Large-Scale Science (WORKS)  
For achieving this objective, we have implemented three new techniques, called Naive Assignment, Staging and Dynamic Scheduling.  ...  The evaluations show that our proposed techniques have significantly improved the performance of the original dispel4py framework.  ...  Its main goal is to assess and forecast the risk and probability of volcanic eruptions and earthquakes in real-time [6] .  ... 
doi:10.1109/works51914.2020.00010 fatcat:jaivbc4qnbbkznernlttfaz2xi

Architectural support for the orchestration of fine-grained multiprocessing for portable streaming applications

Jani Boutellier, Alessandro Cevrero, Philip Brisk, Paolo Ienne
2009 2009 IEEE Workshop on Signal Processing Systems  
Run-time scheduling for fine-grained accelerators solves the utilization problem, but easily produces significant overhead.  ...  To avoid overhead, static multiprocessor schedules are preferable for orchestrating fine-grained accelerators.  ...  RELATED WORK The real-time service providing co-processor Real-Time Unit (RTU) [9] supports static and priority-based scheduling.  ... 
doi:10.1109/sips.2009.5336235 dblp:conf/sips/BoutellierCBI09 fatcat:r5m6lkqmnjgxdf5myha356mohy

An Evolutionary Approach for the Hierarchical Scheduling of Safety- and Security-Critical Multicore Architectures

Brandon Woolley, Susan Mengel, Atila Ertas
2020 Computers  
This research creates a hierarchical scheduling framework as a model for real-time multicore systems to integrate the scheduling for safe and secure systems.  ...  This research provides an efficient, automated method for commercial, private and defense industries to use a genetic algorithm to create a feasible two-level hierarchical schedule for real-time embedded  ...  Related Works Hierarchical Scheduling For real-time systems, there are two types of scheduling approaches: static or fixed priority and dynamic priority schedulers [10] .  ... 
doi:10.3390/computers9030071 fatcat:5dlwuef3cnh2rfya4xq7ihp6qa

A real-time scheduling service for parallel tasks

D. Ferry, Jing Li, M. Mahadevan, K. Agrawal, C. Gill, Chenyang Lu
2013 2013 IEEE 19th Real-Time and Embedded Technology and Applications Symposium (RTAS)  
In this work we describe the design and implementation of a scheduler and runtime dispatcher for a new concurrency platform, RT-OpenMP, whose goal is the execution of real-time workloads with intra-task  ...  The multi-core revolution presents both opportunities and challenges for real-time systems.  ...  In the domain of multiprocessing real-time systems, LITMUS RT [?] provides operating system support for a variety of schedulers for multiprocessing systems. In [?]  ... 
doi:10.1109/rtas.2013.6531098 dblp:conf/rtas/FerryLMAGL13 fatcat:4ybumixaq5fydnzp3wcogpnwkq

Adaptive Optimizations for Stream-based Workflows

Liang Liang, Rosa Filgueira, Yan Yan
2020 Zenodo  
For achieving this objective, we have implementedthree new techniques, calledNaive Assignment,StagingandDynamic Scheduling.  ...  The evaluations show that ourproposed techniques have significantly improved the performanceof the original dispel4py framework.Index Terms—Scientific workflow, Stream-based workflow,Workflow optimization  ...  Its main goal is to assess and forecast the risk and probability of volcanic eruptions and earthquakes in real-time [6] .  ... 
doi:10.5281/zenodo.4396295 fatcat:7auo2a4yxnht3bki4uwzm7uphu

Multiprocessing: An Annotated Bibliography

Satyanarayanan
1980 Computer  
The years since the advent of multiprocessing have and dynanmically assigned specific hardware functions as Univac 1110 permits every I/O device to communicate with the need arises.  ...  The concept of functional partitioning exists here, but theassignment of functions to processors is on *These digests and proceedings are available from the IEEE Computer Socia temporary rather than permanent  ...  Gives heuristic algorithms for optimally scheduling a set of tasks with different resource requirements, but with identical processing times.  ... 
doi:10.1109/mc.1980.1653627 fatcat:fw6llehhwnepvp3ve6shtw4zgu

Evaluation of scheduling heuristics for jitter reduction of real-time streaming applications on multi-core general purpose hardware

M. Westmijze, M. J. G. Bekooij, G. J. M. Smit, M. Schrijver
2011 2011 9th IEEE Symposium on Embedded Systems for Real-Time Multimedia  
The real-time system research community has paid a lot of attention to the design of safety critical hard real-time systems for which the use of non-standard hardware and operating systems can be justified  ...  The proposed scheduling heuristics take the execution times of tasks into account as well as dependencies between the tasks, the data structures accessed by the tasks, and the memory hierarchy.  ...  CONCLUSIONS In this paper we have presented eight scheduling heuristics for the scheduling of static streaming applications on a general purpose multiprocessor system.  ... 
doi:10.1109/estimedia.2011.6088520 dblp:conf/estimedia/WestmijzeBSS11 fatcat:ijhfiwd4nvctrgq3dlyd3lrz5e

Highly Constrained Task Scheduling on Multiprocessing Systems

2007 Journal of the ACS Advances in Computer Science  
A new heuristic with the time complexity of 0(m 2 n), Augmented Least Space-Time First (LSTF), is proposed to minimize the maximum tardiness.  ...  (EDF-E) that schedules each ready task on the processor at which it can be scheduled at the earliest time and with that of EDF-R that select the processor at random.  ...  Analysis for real-world structures The ultimate usefulness of any task allocation heuristic is how well it performs when applied to a representable set of real-world problems.  ... 
doi:10.21608/asc.2007.147561 fatcat:wfbvnvndlrca7oalrem5uotnom

Algorithms for Scheduling Imprecise Computations [chapter]

J. W. S. Liu, K. J. Lin, W. K. Shih, A. C. Yu, J. Y. Chung, W. Zhao
1991 Foundations of Real-Time Computing: Scheduling and Resource Management  
n a hard real-time cyctem, every time-T critical task must meet its timing con- The system scheduler and cxccute3 to conipletion all mandatory td\k\ before their imprecise computations can be easily implemented  ...  is Flex,' an object-oriented language that supports all C++ constructs along with timing-constraint and imprecision primitives. 58 0018-9162/91/0500-0058$01.00 Q 1991 IEEE COMPUTER  ...  Acknowledgments We thank Susan Vrbsky for her comments and suggestions. This work was partially supported by US Navy Office of Naval Research contracts NVY NO0014 87-K-0827 and NVY NO0014 89-J-I 181.  ... 
doi:10.1007/978-1-4615-3956-8_8 fatcat:pgqueb5wgvhyjpf6rgrc7tu6di

Algorithms for scheduling imprecise computations

J.W.S. Liu, K.-J. Lin, W.-K. Shih, A.C.-s. Yu, J.-Y. Chung, W. Zhao
1991 Computer  
n a hard real-time cyctem, every time-T critical task must meet its timing con- The system scheduler and cxccute3 to conipletion all mandatory td\k\ before their imprecise computations can be easily implemented  ...  is Flex,' an object-oriented language that supports all C++ constructs along with timing-constraint and imprecision primitives. 58 0018-9162/91/0500-0058$01.00 Q 1991 IEEE COMPUTER  ...  Acknowledgments We thank Susan Vrbsky for her comments and suggestions. This work was partially supported by US Navy Office of Naval Research contracts NVY NO0014 87-K-0827 and NVY NO0014 89-J-I 181.  ... 
doi:10.1109/2.76287 fatcat:dluqluerpbbxhi2b7l54qawnkm

Performance Evaluation of Application Mapping Approaches for Network-on-Chip Designs

Waqar Amin, Fawad Hussain, Sheraz Anjum, Sarzamin Khan, Naveed Khan Baloch, Zulqar Nain, Sung Won Kim
2020 IEEE Access  
This leads to the realization of efficient mapping approaches for such complex applications.  ...  Apart from the categorization of the discussed approaches, comparison of communication cost, power, energy, and latency of the NoC system carried out on real applications like VOPD and MPEG4.  ...  A greedy heuristic scheduling algorithm for real-world applications proposed in [20] . In this approach, the timing of packet release is determined to minimize contention at the destination.  ... 
doi:10.1109/access.2020.2982675 fatcat:kn6mkit3uvguvc2w6lx5dgddoe

Scheduling to Maximize the Data Transfer Rate for Big Data Applications in Cloud System

2019 International journal of recent technology and engineering  
So scheduling is important to share the resources and path diversity is very much of important in order to get the data within least retrieval time.  ...  In this paper we make a survey to provide the better transfer scheduling algorithm for transfer the data within stipulated time, to maximize the data transfer rate and to choose cost effective paths  ...  method was suitable for creating a real time workload schedule in a shorter time and uses a low memory for this processing.  ... 
doi:10.35940/ijrte.b1053.0782s519 fatcat:yl7ncdtjbfbyxi3q6bst6f4kcq

Scratchpad memory management in a multitasking environment

Bernhard Egger, Jaejin Lee, Heonshik Shin
2008 Proceedings of the 7th ACM international conference on Embedded software - EMSOFT '08  
We evaluate the proposed multiprocess SPM allocation techniques and compare them to a fully-cached reference system by running several multiprocess benchmarks.  ...  Existing SPM allocation schemes do not support multiple tasks or only a fixed number of processes that are known at compile time.  ...  This WCET estimation might not be good enough for real-time tasks with tight timing constraints.  ... 
doi:10.1145/1450058.1450094 dblp:conf/emsoft/EggerLS08 fatcat:5uhfvmw4lnf3resmpky7ol5mzi

Energy-efficient Static Task Scheduling on VFI-based NoC-HMPSoCs for Intelligent Edge Devices in Cyber-physical Systems

Umair Ullah Tariq, Haider Ali, Lu Liu, John Panneerselvam, Xiaojun Zhai
2019 ACM Transactions on Intelligent Systems and Technology  
These overwhelming qualities make MPSoCs an ideal computing platform for numerous real-time applications [2, 52] .  ...  Network-on-Chip (NoC) based Multiprocessor System-on-Chip (MPSoC) architecture is becoming a de-facto computing platform for real-time applications due to its higher performance and Quality-of-Service  ...  We also evaluate the performance of our static scheduler ARSH − FAT I on more complex real benchmark, Robot containing 88 tasks.  ... 
doi:10.1145/3336121 fatcat:glasc3fowzb75iliz7qbapejz4
« Previous Showing results 1 — 15 out of 629 results