A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Filters
A New Strategy for Improving the Effectiveness of Resource Reclaiming Algorithms in Multiprocessor Real-Time Systems
2000
Journal of Parallel and Distributed Computing
The scheduling of tasks in multiprocessor real-time systems has attracted the attention of many researchers in the recent past. ...
In this paper, we propose an estimation strategy which can be used along with a particular class of resource reclaiming algorithms (such as Early Start and RV algorithms) by which the scheduler can estimate ...
Scheduling such tasks in a multiprocessor real-time system requires dynamic scheduling algorithms. ...
doi:10.1006/jpdc.1999.1594
fatcat:nturhpccfrflhlvnm65k7g7h4q
Resource reclaiming in multiprocessor real-time systems
1993
IEEE Transactions on Parallel and Distributed Systems
The algorithms utilize the information given in a multiprocessor task schedule and perform on-line local optimization. The effectiveness of the algorithms is demonstrated through simulation studies. ...
Resource reclaiming is a very important issue in dynamic realtime multiprocessor environments. ...
Molesky for implementing the resource reclaiming algorithms on the Spring Kernel, and F. Wang for providing the Load Generator to generate the task loads for the evaluation of the algorithms. ...
doi:10.1109/71.219754
fatcat:rovvyem425e2dm36p4gvbcjsqm
Multicore CPU reclaiming
2016
Proceedings of the 31st Annual ACM Symposium on Applied Computing - SAC '16
Many resource reclaiming algorithms have been proposed in the literature for single processor scheduling, but not enough work exists for global scheduling in multiprocessor systems. ...
When integrating hard, soft and non-real-time tasks in general purpose operating systems, it is necessary to provide temporal isolation so that the timing properties of one task do not depend on the behaviour ...
While many algorithms (e.g., [18, 15, 10, 17] ) have been developed for reclaiming CPU time in single-processor systems, the problem of reclaiming CPU time in multiprocessor (or multicore) systems has ...
doi:10.1145/2851613.2851743
dblp:conf/sac/AbeniLPS16
fatcat:tykrbrr4z5hvjjtqrirkhmhr3u
Dynamic Scheduling Real-Time Task Using Primary-Backup Overloading Strategy for Multiprocessor Systems
2008
IEICE transactions on information and systems
The scheduling of real-time tasks with fault-tolerant requirements has been an important problem in multiprocessor systems. ...
In order to improve the schedulability we also propose an overloading strategy for PB-overloadin and Backup-backup (BB) overloading. ...
The authors are with the School of Information Science, ...
doi:10.1093/ietisy/e91-d.3.796
fatcat:m6jajknxhzadhj4qptcju5gccq
Migrate when necessary
2017
Proceedings of the 25th International Conference on Real-Time Networks and Systems - RTNS '17
This paper presents a new strategy for scheduling soft real-time tasks on multiple identical cores. ...
The proposed algorithm has been evaluated through simulations, showing its effectiveness (compared to other multi-core reclaiming approaches) and comparing the performance of different partitioning heuristics ...
Acknowledgement This work has been supported in part by the Institut de recherche sur les composants logiciels et matriels pour l information et la communication avancee de Lille, IRCICA, UMR3380. ...
doi:10.1145/3139258.3139280
dblp:conf/rtns/ZahafLA17
fatcat:udm3ey7x5ves5p6shzebjz6v2y
Scheduling imprecise task graphs for real-time applications
2014
International Journal of Embedded Systems
Our heuristic algorithms can effectively reclaim resources when tasks finish earlier than their estimated worst-case execution time. ...
In this paper, we study the allocation/scheduling of imprecise TPGs on multiprocessors to maximise output quality where resources (time and energy) are limited. ...
Acknowledgements The authors would like to thank the referees for their careful reading of the draft manuscript and their perceptive comments. ...
doi:10.1504/ijes.2014.060919
fatcat:p4sscxwbk5gbpdizut2cimtena
Scheduling algorithms and operating systems support for real-time systems
1994
Proceedings of the IEEE
This paper summarizes the state of the real-time field in the areas of scheduling and operating system kernels. ...
In the operating system context, we argue that most of the proprietary commercial kernels as well as real-time extensions to time-sharing operating system kernels do not fit the needs of predictable realtime ...
Simulation results demonstrate that these simple local optimizations can be very effective in improving the system performance in a dynamic realtime system and that resource reclaiming can compensate for ...
doi:10.1109/5.259426
fatcat:pxwm26c4wvgdfczwql6blmvwky
Energy-Efficient Task Partitioning for Real-Time Scheduling on Multi-Core Platforms
2021
Computers
Efficient task partitioning plays a significant role in real-time computing for achieving higher performance alongside sustaining system correctness and predictability and meeting all hard deadlines. ...
Multi-core processors have become widespread computing engines for recent embedded real-time systems. ...
The authors of [11, 41] extend SRP to the Multiprocessor Stack Resource Policy (MSRP), the first spin-lock protocol in multiprocessor real-time systems. ...
doi:10.3390/computers10010010
fatcat:serhkrztfzgvbdg6dqngawz5wm
Adaptable Fault Tolerance for Real-Time Systems
[chapter]
1995
Responsive Computer Systems: Steps Toward Fault-Tolerant Real-Time Systems
This paper proposes a framework for software-implemented, adaptive fault tolerance in a real-time context. ...
Run-time efficiency can thus be improved while preserving a high degree of predictability of execution. ...
Acknowledgements This work was supported in part by the Commission of the European Communities, in the framework of the ESPRIT Basic Research Project 6362 "Predictably Dependable Computing Systems" (PDCS2 ...
doi:10.1007/978-1-4615-2271-3_10
fatcat:ba665t6rxnenrl7atesvys7cma
Efficient Resource Management Mechanism with Fault Tolerant Model for Computational Grids
2014
International Journal of Computer Applications Technology and Research
The grid scheduling is responsible for resource discovery, resource selection and job assignment over a decentralized heterogeneous system. ...
In the existing system, primary-backup approach is used for fault tolerance in a single environment. In this approach, each task has a primary copy and backup copy on two different processors. ...
This algorithm can tolerate more than one fault at a time and employs techniques such as distance concept, flexible backup overloading and resource reclaiming to improve the guarantee ratio of the system ...
doi:10.7753/ijcatr0312.1004
fatcat:fyc3th7gmnaktb7d3laphsjsk4
Server-based scheduling of parallel real-time tasks
2012
Proceedings of the tenth ACM international conference on Embedded software - EMSOFT '12
tasks, leaving the actual and dynamic scheduling of these regions onto processors to be performed at runtime, exploiting the maximum amount of parallelism. ...
Parallel programming models are being put forward to provide a better approach for application programmers to expose the opportunities for parallelism by pointing out potentially parallel regions within ...
Acknowledgements This work was partially supported by National Funds through FCT (Portuguese Foundation for Science and Technology) and by ERDF (European Regional Development ...
doi:10.1145/2380356.2380374
dblp:conf/emsoft/NogueiraP12
fatcat:f3nnftts6fcglmkc7qbknspiua
Energy efficient scheduling simulator for distributed real-time systems
2011
2011 International Conference on Recent Trends in Information Technology (ICRTIT)
Battery powered real-time systems have been widely used in many applications. ...
Thus, minimizing power consumption and extending battery life while guaranteeing the timing constraints has become a critical aspect in designing such systems. ...
Hence the modified LP algorithm is improved over the basic LP algorithm to provide resource reclaiming at program runtime for scheduler to adjust the schedule online according to the actual execution time ...
doi:10.1109/icrtit.2011.5972342
fatcat:v4hu4urbtrdzvgcusmkzpkcf2e
Synchronization-Aware Energy Management for VFI-Based Multicore Real-Time Systems
2012
IEEE transactions on computers
For a set of periodic real-time tasks that access shared resources running on a VFI-based multicore system with dynamic voltage and frequency scaling (DVFS) capability, we study both static and dynamic ...
Taking the additional delay due to task synchronization into consideration, the new scheme allocates slack in a fair manner and scales down the execution of both non-critical and critical sections of tasks ...
Any opinions, findings, and conclusions as well as recommendations expressed in this material are those of the authors and do not necessarily reflect the views of the National Science Foundation. ...
doi:10.1109/tc.2012.136
fatcat:75rr74einfcoxhczjuwsw2yctq
New Trends in Real Time Operating Systems
2012
IOSR Journal of Engineering
After describing the characteristics of modern embedded applications, the paper presents the problems of the current approaches and discusses the new research trends in real time operating systems and ...
The objective of this document is to introduce Real Time Operating System to new comers the major research trends identified. ...
In fact, in the presence of timing and resource constraints, the performance of a real-time system does not always improve as the speed of the processor is increased. ...
doi:10.9790/3021-0204883892
fatcat:33y4ita445aftnzd4kcjohv5du
New Trends in Real Time Operating Systems
2017
International Journal for Research in Applied Science and Engineering Technology
In other words, the behaviour of real-time system must be predictable in all situations. A. Predictability To achieve predictability, all components of the real-time system must be time bounded. ...
After describing the characteristics of modern embedded applications, the paper presents the problems of the current approaches and discusses the new research trends in real time operating systems and ...
In fact, in the presence of timing and resource constraints, the performance of a real-time system does not always improve as the speed of the processor is increased. ...
doi:10.22214/ijraset.2017.9033
fatcat:wyclcrtpkfaonbklarliad7d2m
« Previous
Showing results 1 — 15 out of 426 results