Filters








7,267 Hits in 4.3 sec

A WEAKLY HARD SCHEDULING APPROACH OF PARTITIONED SCHEDULING ON MULTIPROCESSOR SYSTEMS

Habibah Ismail, Dayang N. A. Jawawi
2015 Jurnal Teknologi  
As real-time application systems increasingly come to be implemented upon multiprocessor environments, thus, this study applies multiprocessor scheduling approach for verification of weakly hard real-time  ...  In this paper, a weakly hard scheduling approach has been proposed and schedulability analysis of proposed approach consists of the partitioned multiprocessor scheduling techniques with solutions for the  ...  their financial support and not forgotten, the Software Engineering Research Group (SERG) and EReTSEL lab members for their help.  ... 
doi:10.11113/jt.v77.6204 fatcat:2enfmudg7rewnje3ttsqhjip6a

Software environment for a multiprocessor DSP

Asawaree Kalavade, Joe Othmer, Bryan Ackland, K. J. Singh
1999 Proceedings of the 36th ACM/IEEE conference on Design automation conference - DAC '99  
The run-time kernel includes a low-overhead, preemptive, dynamic scheduler with multiprocessor support that guarantees real-time performance to admitted tasks.  ...  In this paper, we describe the software environment for Daytona, a single-chip, bus-based, shared-memory, multiprocessor DSP. The software environment is designed around a layered architecture.  ...  Further, applications often tend to have real-time constraints. To support these requirements, we have designed a dynamic scheduling environment.  ... 
doi:10.1145/309847.310078 dblp:conf/dac/KalavadeOAS99 fatcat:5o32coryxzeuroxi3x54zct7la

A schedulability analysis for weakly hard real-time tasks in partitioning scheduling on multiprocessor systems

Habibah Ismail, Dayang N. A. Jawawi
2014 2014 8th. Malaysian Software Engineering Conference (MySEC)  
For a traditional real-time system, timing requirements in hard real-time are very restrictive, must meet all the tasks deadlines.  ...  Thus, in order to deal with the problem, the partitioned multiprocessor scheduling techniques with solutions for the bin-packing problem, named R-BOUND-MP-NFRNS (R-BOUND-MP with next-fit-ring noscaling  ...  their financial support and not forgotten, the Software Engineering Research Group (SERG) and EReTSEL lab members for their help.  ... 
doi:10.1109/mysec.2014.6985998 fatcat:7mkzisq7ibfdfbqqrpa2vsbiee

Reliability-Driven Energy-Efficient Task Scheduling for Multiprocessor Real-Time Systems

Tongquan Wei, Xiaodao Chen, Shiyan Hu
2011 IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems  
This paper proposes a reliability-driven task scheduling scheme for multiprocessor real-time embedded systems that optimizes system energy consumption under stochastic fault occurrences.  ...  The proposed scheme, which considers both the dynamic power and the leakage power, is able to handle the scheduling of independent tasks and tasks with precedence constraints, and is capable of scheduling  ...  [10] proposed an energy-efficient task allocation and scheduling schemes with deterministic fault-tolerance capabilities for symmetric multiprocessor systems executing tasks with hard real-time constraints  ... 
doi:10.1109/tcad.2011.2160178 fatcat:mos6koswrbgpdfrn6xvxqyy6ca

REHLib: New Optimal Implementation of Reconfigurable Energy Harvesting Multiprocessor Systems

Wiem Housseyni, Olfa Mosbahi, Mohamed Khalgui
2017 Proceedings of the 12th International Conference on Software Technologies  
The designs of reconfigurable embedded real-time energy harvesting multiprocessor systems are evolving for higher energy efficiency, high-performance and flexible computing.  ...  The objective of this work is to develop software components for the design of real-time operating systems.  ...  However, none of these approaches provide support for real-time reconfigurable multiprocessor energy harvesting based applications yet.  ... 
doi:10.5220/0006432203460354 dblp:conf/icsoft/HousseyniMK17 fatcat:strldcfeq5gn3ewzypcz2yypom

Optimal Multiprocessor Real-Time Scheduling Based on RUN with Voltage and Frequency Scaling

Hiroyuki Chishiro, Masayoshi Takasu, Rikuhei Ueda, Nobuyuki Yamasaki
2015 2015 IEEE 18th International Symposium on Real-Time Distributed Computing  
S-RUNT, and Real-Time Dynamic Voltage and Frequency Scaling, called D-RUNT.  ...  This paper proposes Reduction to Uniprocessor Transformation (RUNT), which is an optimal multiprocessor realtime scheduling algorithm based on RUN with Real-Time Static Voltage and Frequency Scaling, called  ...  ACKNOWLEDGEMENT This research was supported in part by the Core Research for Evolutional Science and Technology, Japan Science and Technology Agency, Keio Leading-edge Laboratory of Science and Technology  ... 
doi:10.1109/isorc.2015.9 dblp:conf/isorc/ChishiroTUY15 fatcat:r6obyqalznearbwpn2jg3iyw64

STORM a simulation tool for real-time multiprocessor scheduling evaluation

R Urunuela, A Déplanche, Y Trinquet
2010 2010 IEEE 15th Conference on Emerging Technologies & Factory Automation (ETFA 2010)  
The increasing complexity of the hardware multiprocessor architectures as well as of the real-time applications they support makes very difficult even impossible to apply the theoretical real-time multiprocessor  ...  Thus, so as to be able to evaluate and compare real-time multiprocessor scheduling strategies on their schedulability performance as well as energy efficiency, we have preferred a simulation approach and  ...  This has led to renewed interest in multiprocessor real-time scheduling: scheduling algorithms together with schedulability analysis.  ... 
doi:10.1109/etfa.2010.5641179 dblp:conf/etfa/UrunuelaDT10 fatcat:6clefohfo5do7dd5xe6ynsh2vm

Leakage-aware dynamic scheduling for real-time adaptive applications on multiprocessor systems

Heng Yu, Bharadwaj Veeravalli, Yajun Ha
2010 Proceedings of the 47th Design Automation Conference on - DAC '10  
In addition to conventional scheduling requirements such as real-time and dynamic power, emerging challenges such as leakage power and multiprocessors further complicate the formulation and solution of  ...  In this paper, we propose a runtime adaptive application scheduling scheme that efficiently distributes the runtime slack in a task graph, to achieve maximized performance under timing and dynamic/leakage  ...  A naive yet under-optimized approach for multiprocessor systems can be distributing the slack time and energy to the direct slack receiver on the same processor, such that system timing and energy constraints  ... 
doi:10.1145/1837274.1837396 dblp:conf/dac/YuVH10 fatcat:b4axjthglndprl4jpbvzxmj2s4

Machine Learning support Energy Aware Efficient Multiprocessors Mapping of Real Time tasks

Shahira M. Habashy
2019 Zenodo  
Using processor which supported a Dynamic Voltage Scaling (DVS), can lower power consumption by scaling down the processor' frequency while all task sets still don't miss their deadline.  ...  We show how lightweight ANNs can equip highly true performance predictions for a different set of applications thereby aiding to improve scheduling effectiveness.  ...  Energy Aware Neural Network Scheduling and Mapping Model (EANNSM) Multiprocessor real-time scheduling intent to implement a task set belong to an application, using the given multiprocessor system, such  ... 
doi:10.5281/zenodo.3252967 fatcat:vvopcz6rtrfifga6fvhogr4ivq

Resource reclaiming in multiprocessor real-time systems

C. Shen, K. Ramamritham, J.A. Stankovic
1993 IEEE Transactions on Parallel and Distributed Systems  
Abstruct-Most real-time scheduling algorithms schedule tasks with respect to their worst case computation times.  ...  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

Implications of classical scheduling results for real-time systems

J.A. Stankovic, M. Spuri, M. Di Natale, G.C. Buttazzo
1995 Computer  
Uni-processor and multiprocessor results are addressed as well as important issues such a s future release times, precedence constraints, shared resources, task value, overloads, static versus dynamic  ...  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.  ...  Dynamic Multiprocessor Scheduling There are so few real-time classical scheduling results for dynamic multiprocessing scheduling that we treat preemptive and non-preemptive cases together.  ... 
doi:10.1109/2.386982 fatcat:pgdsgkk5mbhzra4bud4w5fxerq

Evaluation of the Proposed Hybrid Multiprocessor Real-Time Scheduling Approach with Partitioned and Global Approaches

Ismail Habibah, N. A. Jawawi Dayang, Ahmedy Ismail, Isa Mohd Adham, Lim Meng Hee
2019 MATEC Web of Conferences  
This indicates that such a hybrid scheduling approach is a viable alternative to use in multiprocessor systems and for best scheduled constrained deadline periodic tasks where timing constraints known  ...  Studies have shown that most prior research on hybrid multiprocessor real-time scheduling has been confined to hard and soft real-time tasks.  ...  The authors would like to express profound gratitude to the Universiti Teknologi Malaysia (UTM) and University of Malaya for their financial support under research grant RF006D-2018 and BK043-2015 and  ... 
doi:10.1051/matecconf/201925505004 fatcat:sfuyi42xmbbizobthq4fqb3fyu

Scheduling algorithms and operating systems support for real-time systems

K. Ramamritham, J.A. Stankovic
1994 Proceedings of the IEEE  
This paper summarizes the state of the real-time field in the areas of scheduling and operating system kernels.  ...  The four paradigms are: static tabledriven scheduling, static priority preemptive scheduling, dynamic planning-based scheduling, and dynamic best efSort scheduling.  ...  real-time support for multiprocessors and distributed systems.  ... 
doi:10.1109/5.259426 fatcat:pxwm26c4wvgdfczwql6blmvwky

Semi-fixed-priority scheduling with multiple mandatory parts

Hiroyuki Chishiro, Nobuyuki Yamasaki
2013 16th IEEE International Symposium on Object/component/service-oriented Real-time distributed Computing (ISORC 2013)  
The practical imprecise computation model is supported by dynamic-priority scheduling on uniprocessors. Unfortunately, dynamic-priority scheduling is difficult to support multiprocessors.  ...  An imprecise computation model has the advantage of supporting overloaded conditions in dynamic real-time environments, compared to Liu and Layland's model.  ...  In addition, multiprocessor real-time scheduling for imprecise computation can also be supported to overcome overloaded conditions.  ... 
doi:10.1109/isorc.2013.6913216 dblp:conf/isorc/ChishiroY13 fatcat:7nnypahblbfqxjualjsozybl3a

Energy Saving Approaches for Scheduling on Parallel Systems: A Review

Sunita Kushwaha, Sanjay Kumar
2016 International Journal of Computer Applications  
One of them is scheduling. Scheduling is frequently required in parallel systems (Distributed System, Embedded System and Multi -core System).  ...  There are various parallel systems in which some are hand held device such as laptop and some other such as distributed and embedded system that required energy saving for long life, become vital challenge  ...  Emanuele Cannella used offline VFS for schedule independent periodic real time task on embedded homogeneous multiprocessor and proposed a semipartitioned scheduling algorithm, called Earliest Deadline  ... 
doi:10.5120/ijca2016911798 fatcat:qwvt2inypnh6nbvf7rshf5sa3y
« Previous Showing results 1 — 15 out of 7,267 results