8,842 Hits in 5.4 sec

Relative Deadline Analysis in Multitasking RTS using RM & EDF Scheduling

Sandeep S Chapalkar*, Karibasappa K.
2021 International journal of recent technology and engineering  
The scheduling policies considered are widely used scheduling policies like Rate Monotonic (RM) and Earliest Deadline First (EDF) to analyze and understand the impact on relative deadline with respect  ...  The results obtained will decisively conclude the suitable scheduling policy for a set of processes under different process load conditions.  ...  Earliest Deadline First (EDF) Scheduling Analysis: The process scheduling is implemented using EDF scheduling method is shown in table 3.  ... 
doi:10.35940/ijrte.a5900.0510121 fatcat:x2qgfp4qfnhh7kgxpsikqw2mze

An Efficient Scheduling Strategy for Overloaded Real Time System

Vijayshree Shinde, Seema C.
2017 International Journal of Computer Applications  
Priority Earliest Deadline first scheduling algorithm.  ...  Earliest Deadline First algorithm is optimal scheduling algorithm for single processor real time systems when the systems are preemptive and underloaded.  ...  A Group Priority Earliest Deadline First scheduling algorithm GPEDF perform schedulability test prior to grouping a particular job.  ... 
doi:10.5120/ijca2017915630 fatcat:c3h3xeszqbcolpfuuq7h4drsri

Grid scheduling algorithm based on application diversity

Aditi Sharma, Raj kumari
2012 International Journal of Advances in Computing and Information Technology  
We present an extension to the existing conservative backfill by creating multiple queues for jobs based on their runtime along with earliest deadline first (EDF) scheduling policy, which improves the  ...  performance of the algorithm in terms of Average weighted response time (AWRT) and average slowdown of the jobs.  ...  For this we apply two techniques, one is by separating the short jobs by long ones using partitions and other scheduling the waiting jobs according to the earliest deadline first policy.  ... 
doi:10.6088/ijacit.12.14008 fatcat:um3tk6pg2vfkbbld7hmlaoxc54

Enhancement of Generalized Earliest Deadline First Policy

Mourad Kaddes, Laurent Amanton, Alexandre Berred, Bruno Sadeg, Majed Abdouli
2013 Proceedings of the 15th International Conference on Enterprise Information Systems  
The main policy used to schedule transactions in RTDBSs is Earliest Deadline First (EDF). However, it is well-known that EDF is not efficient for scheduling transactions in overload conditions.  ...  In this paper, an RTDBSs analysis is presented. The accuracy of GEDF scheduling policy and the influence of database workload on the system performances is investigated.  ...  ., 2012) , authors have proposed a new scheduling algorithms called Adaptive Earliest Deadline First Co-Scheduling (AEDF-Co).  ... 
doi:10.5220/0004448802310238 dblp:conf/iceis/KaddesABSA13 fatcat:gbimzbh6hreyzoof5ku26spcda

On-Line and Off-Line DVS for Fixed Priority with Preemption Threshold Scheduling

Liu Yang, Lin Man
2009 2009 International Conference on Embedded Software and Systems  
Fixed Priority with Preemption Threshold (FPPT) scheduling is a scheduling policy that includes preemptive and non-preemptive aspect of scheduling policy.  ...  Along with the prevailing of mobile devices, the demand for efficient power consumption has become one of the major issues in designing embedded system.  ...  The method developed by Jejurikar and Gupta [6] find SSS under non-preemptive task system based on the Earliest Deadline First (EDF) scheduling policy.  ... 
doi:10.1109/icess.2009.50 dblp:conf/icess/YangL09 fatcat:5m63ppsbbjaepiq5d6pi36pkz4

Performance Analysis of Multiple Site Resource Provisioning: Effects of the Precision of Availability Information [chapter]

Marcos Dias de Assunção, Rajkumar Buyya
2008 Lecture Notes in Computer Science  
Emerging deadline-driven Grid applications require a number of computing resources to be available over a time frame, starting at a specific time in the future.  ...  Performance evaluation is conducted considering both multiple scheduling policies in resource providers and multiple provisioning policies in brokers, while varying the precision of availability information  ...  Acknowledgements We thank the Grid Workloads Archive group for making the Grid workload traces available. This work is supported by DEST and ARC project grants.  ... 
doi:10.1007/978-3-540-89894-8_17 fatcat:nlo5s47gzbdwhjdzfqghg4urlq

Scheduling an active camera to observe people

Cash J. Costello, Christopher P. Diehl, Amit Banerjee, Hesky Fisher
2004 Proceedings of the ACM 2nd international workshop on Video surveillance & sensor networks - VSSN '04  
We present some candidate scheduling policies to address these challenges and evaluate their performance.  ...  Remote identification of people is an important capability for security systems.  ...  The authors would also like to acknowledge the efforts of Salvatore Guarnieri in the creation of the demonstration system.  ... 
doi:10.1145/1026799.1026808 fatcat:d34bgupthfblfawxvxciintt3a

Scheduling real-time transactions: a performance evaluation

Robert K. Abbott, Hector Garcia-Molina
1992 ACM Transactions on Database Systems  
We describe a new group of algorithms for scheduling real-time transactions that produce serializable schedules.  ...  We present a model for scheduling transactions with deadlines on a single processor disk resident database system, and evaluate the scheduling algorithms through detailed simulation experiments.  ...  They study three priority functions for CPU scheduling: earliest deadline first, most critical first and a function that combines criticalness and deadlines.  ... 
doi:10.1145/132271.132276 fatcat:ownx4bwdkzdytbpqhx3gn5oh24

Channel-quality dependent earliest deadline due fair scheduling schemes for wireless multimedia networks

Ahmed K. F. Khattab, Khaled M. F. Elsayed
2004 Proceedings of the 7th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems - MSWiM '04  
In the first proposed scheme, the Channel-Dependent Earliest-Due-Date (CD-EDD) discipline, the expiration time of the head of line packets of users' queues is taken into consideration in conjunction with  ...  We propose and evaluate the performance of two channel-aware scheduling schemes that are capable of providing such delay guarantees in wireless networks.  ...  We propose a new scheduling discipline, which we call the Channel Dependent Earliest Due Date first (CD-EDD) policy.  ... 
doi:10.1145/1023663.1023672 dblp:conf/mswim/KhattabE04 fatcat:b5a5mtv2vvc37h3ugblmspjfw4

Scheduling real-time transactions

Robert Abbott, Hector Garcia-Molina
1988 SIGMOD record  
We describe a new group of algorithms for scheduling real-time transactions that produce serializable schedules.  ...  We present a model for scheduling transactions with deadlines on a single processor disk resident database system, and evaluate the scheduling algorithms through detailed simulation experiments.  ...  They study three priority functions for CPU scheduling: earliest deadline first, most critical first and a function that combines criticalness and deadlines.  ... 
doi:10.1145/44203.44209 fatcat:pxbmxnef7jgkhplh5um5bmxqxe

Comparison of Flow Scheduling Policies for Mix of Regular and Deadline Traffic in Datacenter Environments [article]

Mohammad Noormohammadpour, Cauligi S. Raghavendra
2017 arXiv   pre-print
We consider FCFS (First Come First Serve), SRPT (Shortest Remaining Processing Time) and Fair Sharing as deadline agnostic approaches and a combination of Earliest Deadline First (EDF) with either FCFS  ...  There are several scheduling policies for either traffic type with focus on minimizing completion times or deadline miss rate.  ...  We perform simulations to explore effectiveness of a range of scheduling policies for mix flow scheduling.  ... 
arXiv:1707.02024v1 fatcat:ch7kmpo7zveivkvh2y6w4dojiq

Schedulability Analysis of DeferrableScheduling Algorithms for MaintainingReal-Time Data Freshness

Song Han, Deji Chen, Ming Xiong, Kam-Yiu Lam, Aloysius K. Mok, Krithi Ramamritham
2014 IEEE transactions on computers  
To resolve the limitation of fixed priority scheduling in DS-FP, we then extend the deferrable scheduling to a dynamic priority scheduling algorithm called DS-EDF by applying the earliest deadline first  ...  Although the deferrable scheduling algorithm for fixed priority transactions (DS-FP) has been shown to provide a better performance compared with the More-Less (ML) method, there is still a lack of any  ...  Since DS-FP is a fixed priority scheduling method, we extend it to dynamic scheduling with the proposal of DS-EDF which uses the earliest deadline first policy to schedule update jobs.  ... 
doi:10.1109/tc.2012.266 fatcat:hsrcs6g3ufgcndyia7oz443wci

Adding Robustness in Dynamic Preemptive Scheduling [chapter]

Giorgio C. Buttazzo, John A. Stankovic
1995 Responsive Computer Systems: Steps Toward Fault-Tolerant Real-Time Systems  
In this paper we i n troduce a robust earliest deadline scheduling algorithm for dealing with hard aperiodic tasks under overloads in a dynamic real-time environment.  ...  The experimental results show excellent performance of the new algorithm in normal and overload conditions.  ...  Robust Dynamic Scheduling 5 Throughout our discussion, we assume that a set of aperiodic tasks is scheduled on a uniprocessor system by the Earliest Deadline First (EDF) scheduling algorithm, according  ... 
doi:10.1007/978-1-4615-2271-3_4 fatcat:vmtojr5werhl3euvo3lczjddsm

On-Line Event-Driven Scheduling for Electric Vehicle Charging via Park-and-Charge

Fanxin Kong, Qiao Xiang, Linghe Kong, Xue Liu
2016 2016 IEEE Real-Time Systems Symposium (RTSS)  
We leverage both the competitive analysis and resource augmentation to demonstrate the non-constant and constant performance bounds for the earliest-deadline-first and highest-value-first algorithms respectively  ...  Moreover, we provide a stronger theoretical result, i.e., the performance bound for the whole class of work-conserving scheduling algorithms.  ...  The authors would like to thank the anonymous reviewers for their constructive comments and thank Dr. Dip Goswami for shepherding the revision process.  ... 
doi:10.1109/rtss.2016.016 dblp:conf/rtss/KongXKL16 fatcat:iwqbmans5fd5deyw3xk3nlbqba

Tardiness Reduction Technique for Multiprocessor Scheduling based on New Assignment Strategy

Ms. Neha Jain, Mrs. Varsha Zokakar
2015 International Journal of Computer Trends and Technology  
In the real-time system, scheduling is an important factor which decides a schedule for a set of tasks.  ...  These all are the techniques, based on the assignment priority of jobs. Here we proposed a new concept High-Low High-Utilization-first (HLHUF) for tardiness reduction.  ...  Under current analysis, soft real-time tardiness bounds applicable to global earliest-deadline-first scheduling and related policies depend on per-task worst-case execution times.  ... 
doi:10.14445/22312803/ijctt-v25p107 fatcat:gxzl7anwv5g4rgee4co6w5gnqe
« Previous Showing results 1 — 15 out of 8,842 results