Filters








654,114 Hits in 7.7 sec

The case for prediction-based best-effort real-time systems [chapter]

Peter A. Dinda, Bruce Lowekamp, Loukas F. Kallivokas, David R. O'Hallaron
1999 Lecture Notes in Computer Science  
We propose a prediction-based best-effort real-time service to support distributed, interactive applications in shared, unreserved computing environments.  ...  Finally, we present evidence that the service is feasible in the form of two studies of algorithms for host load prediction and for predictive task mapping.  ...  Evidence for a history-based prediction approach Is history-based prediction a feasible approach to implementing a best-effort real-time service for the application domain we described earlier?  ... 
doi:10.1007/bfb0097913 fatcat:fvp2f23aq5gjngqogvl4nbcg5y

Temperature Aware Scheduling for Embedded Processors

Ramkumar Jayaseelan, Tulika Mitra
2009 2009 22nd International Conference on VLSI Design  
fairness and real time constraints.  ...  In this paper, we propose a temperature aware scheduling technique in the context of embedded multi-tasking systems.  ...  Our system consists of soft real-time (multimedia) and best-effort tasks.  ... 
doi:10.1109/vlsi.design.2009.42 dblp:conf/vlsid/JayaseelanM09 fatcat:iw24snhkpbfpdij2s2zrloowqq

Temperature Aware Scheduling for Embedded Processors

Ramkumar Jayaseelan, Tulika Mitra
2009 Journal of Low Power Electronics  
fairness and real time constraints.  ...  In this paper, we propose a temperature aware scheduling technique in the context of embedded multi-tasking systems.  ...  Our system consists of soft real-time (multimedia) and best-effort tasks.  ... 
doi:10.1166/jolpe.2009.1036 fatcat:in44mrceazfcdavweu5dt5e6z4

Deterministic Memory Abstraction and Supporting Multicore System Architecture [article]

Farzad Farshchi, Prathap Kumar Valsan, Renato Mancuso, Heechul Yun
2018 arXiv   pre-print
Poor time predictability of multicore processors has been a long-standing challenge in the real-time systems community.  ...  In contrast, we call the conventional memory abstraction as best-effort memory in which only highly pessimistic worst-case bounds can be achieved.  ...  Any opinions, findings, and conclusions or recommendations expressed in this publication are those of the authors and do not necessarily reflect the views of the NSF.  ... 
arXiv:1707.05260v4 fatcat:lt76fnjqhfgfbdppvaaqqh6poq

Deterministic Memory Abstraction and Supporting Multicore System Architecture

Farzad Farshchi, Prathap Kumar Valsan, Renato Mancuso, Heechul Yun, Marc Herbstritt
2018 Euromicro Conference on Real-Time Systems  
In contrast, we call the conventional memory abstraction as best-effort memory in which only highly pessimistic worst-case bounds can be achieved.  ...  Poor time predictability of multicore processors has been a long-standing challenge in the realtime systems community.  ...  requests exist, in order to achieve tightly bounded worst-case timing for deterministic memory while achieving pessimistic, but still bounded, worst-case timing for best-effort memory.  ... 
doi:10.4230/lipics.ecrts.2018.1 dblp:conf/ecrts/FarshchiV0Y18 fatcat:xekrdpguhnh3rno5323hto2m3y

RT-Gang: Real-Time Gang Scheduling Framework for Safety-Critical Systems [article]

Waqar Ali, Heechul Yun
2019 arXiv   pre-print
The results show that RT-Gang dramatically improves system predictability and the overhead is negligible.  ...  Specifically, any idle cores, if exist, are used to schedule best-effort tasks but their maximum memory bandwidth usages are strictly throttled to tightly bound interference to real-time gang tasks.  ...  Safe Best-Effort Task Co-Scheduling , in the system. τ RT 1 and τ RT 2 are real-time tasks.  ... 
arXiv:1903.00999v2 fatcat:lmr4ya6vx5frdimd7rrhcvn75u

Low-overhead hard real-time aware interconnect network router

Michel A. Kinsy, Srinivas Devadas
2014 2014 IEEE High Performance Extreme Computing Conference (HPEC)  
We propose a network-on-chip router that provides predictable and deterministic communication latency for hard real-time data traffic while maintaining high concurrency and throughput for best-effort/general-purpose  ...  This trend gives rise to new problems such as the sharing of on-chip network resources among hard real-time and normal best effort data traffic.  ...  real-time flows and the other by the best effort flows.  ... 
doi:10.1109/hpec.2014.7040976 dblp:conf/hpec/KinsyD14 fatcat:scnalfnj3ba5vpjb3chisz4xoy

A non-preemptive scheduling algorithm for soft real-time systems

Wenming Li, Krishna Kavi, Robert Akl
2007 Computers & electrical engineering  
Real-time systems are often designed using preemptive scheduling and worst-case execution time estimates to guarantee the execution of high priority tasks.  ...  We will present results comparing gEDF with other real-time algorithms including, EDF, Best-effort, and Guarantee, by using randomly generated tasks with varying execution times, release times, deadlines  ...  Moreover, estimating system load based on worst-case execution times, leads to under-utilizations, thus predicting overloaded conditions incorrectly.  ... 
doi:10.1016/j.compeleceng.2006.04.002 fatcat:dfo6byvykvadzfzg4feafhrf4y

Model-Based Virtual Components in Event-Based Controls: Linking the FMI and IEC 61499

Michael H. Spiegel, Edmund Widl, Bernhard Heinzl, Wolfgang Kastner, Nabil Akroud
2020 Applied Sciences  
Based on considered standards for model exchange (FMI) and controls (IEC 61499), important properties such as real-time capabilities are derived and experimentally validated.  ...  It has been often demonstrated that linking discrete event-based control systems and hybrid plant models can advance the quality of control implementations.  ...  Preliminary work outlining predictive real-time event synchronization for automation systems has been presented in [25] , but no closed-loop operation and only limited support for a best-effort operation  ... 
doi:10.3390/app10051611 fatcat:grbxhcczivgqxchujw3vxhyl3a

Feedback-controlled resource sharing for predictable eScience

Sang-Min Park, Marty Humphrey
2008 2008 SC - International Conference for High Performance Computing, Networking, Storage and Analysis  
The emerging class of adaptive, real-time, data-driven applications are a significant problem for today's HPC systems.  ...  In general, it is extremely difficult for queuing-system-controlled HPC resources to make and guarantee a tightly-bounded prediction regarding the time at which a newly-submitted application will execute  ...  Throughout the experiments, all 8 best-effort VMs continuously run best-effort jobs whose running time ranges from 10 to 30 minutes when the server is idle.  ... 
doi:10.1109/sc.2008.5217786 dblp:conf/sc/ParkH08 fatcat:mynsk75ua5b5zk3m5a7ehi2yku

Application performance in the QLinux multimedia operating system

Vijay Sundaram, Abhishek Chandra, Pawan Goyal, Prashant Shenoy, Jasleen Sahni, Harrick Vin
2000 Proceedings of the eighth ACM international conference on Multimedia - MULTIMEDIA '00  
We present QLinux-a multimedia operating system based on the Linux kernel that meets this requirement.  ...  We experimentally evaluate the efficacy of these mechanisms using benchmarks and real-world applications.  ...  The best-effort leaf class was scheduled using the standard time sharing scheduler, while the soft real-time leaf class was scheduled using SFQ.  ... 
doi:10.1145/354384.354448 dblp:conf/mm/SundaramCGSSV00 fatcat:cyhlpkxtwreijgcip43dc4ls4i

Design for Timing Predictability

Lothar Thiele, Reinhard Wilhelm
2004 Real-time systems  
A large part of safety-critical embedded systems has to satisfy hard real-time constraints.  ...  This article describes threats to timing predictability of systems, and proposes design principles that support timing predictability.  ...  The differences between the upper and lower bounds and the worst and best cases of execution times, respectively, are measures for the timing predictability of the whole system.  ... 
doi:10.1023/b:time.0000045316.66276.6e fatcat:m6bkbjiqezap7kd3jhtbmamdem

Virtual Gang based Scheduling of Real-Time Tasks on Multicore Platforms [article]

Waqar Ali and Rodolfo Pellizzoni and Heechul Yun
2020 arXiv   pre-print
We propose a virtual-gang based parallel real-time task scheduling approach for multicore platforms.  ...  Our approach is based on the notion of a virtual-gang, which is a group of parallel real-time tasks that are statically linked and scheduled together by a gang scheduler.  ...  The taskset for the case-study is shown in Table 2 . It consists of three real-time tasks and two best-effort ones.  ... 
arXiv:1912.10959v2 fatcat:rjuxnl7gwvgqfokwzfikzxnvca

Techniques for enhancing real-time CORBA quality of service

I. Pyarali, D.C. Schmidt, R.K. Cytron
2003 Proceedings of the IEEE  
End-to-end predictability of remote operations is essential for many fixed-priority distributed real-time and embedded (DRE) applications, such as command and control systems, manufacturing process control  ...  This paper provides two contributions to the study of Real-time CORBA middleware for DRE applications.  ...  Fig. 23 . 23 Configuration for measuring the effect of increasing best-effort work in Real-time CORBA.  ... 
doi:10.1109/jproc.2003.814616 fatcat:fh7oe65ehvcalcfbhlasq6st4q

An Adaptive Emergency First Intelligent Scheduling Algorithm for Efficient Task Management and Scheduling in Hybrid of Hard Real-Time and Soft Real-Time Embedded IoT Systems

Sehrish Malik, Shabir Ahmad, Israr Ullah, Dong Hwan Park, DoHyeun Kim
2019 Sustainability  
In autonomous technology, real-time systems and real-time computing are of core importance. It is crucial for embedded IoT devices to respond in real-time; along with fulfilling all the constraints.  ...  The proposed scheduling algorithm aims to distribute the CPU resources fairly to the possibly starving, in overloaded cases, soft real-time tasks while focusing on the execution of high priority hard real-time  ...  Conflicts of Interest: The authors declare no conflict of interest.  ... 
doi:10.3390/su11082192 fatcat:24pdvyccajefpdl7po4ajant4i
« Previous Showing results 1 — 15 out of 654,114 results