An Algorithm to Reduce the Time Complexity of Earliest Deadline First Scheduling Algorithm in Real-Time System

Singh, Joginder

doi:10.14569/ijacsa.2011.020207

Cited by 26 publications

(11 citation statements)

References 23 publications

(23 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We can prove that the output of Algorithm 2 is the optimal solution that satisfies the KKT condition (25), in Theorem 2.…”

Section: Lovra Algorithmmentioning

confidence: 99%

“…As such, as long as we can solve the corresponding KKT conditions (as shown in Formula (25)), we can solve the problem optimally. Whereas, it is non-trivial to directly solve the Formula (25).…”

Section: Local Optimal Vm Resource Allocation (Lovra) 331 Problem mentioning

confidence: 99%

“…As a comparative baseline, we also implement two more node-selection strategy, namely random policy (RAN) and Earliest Deadline First (EDF) strategy. The former is adopted in our previous work [14] and the latter is commonly used in many other task scheduling designs [24,25]. Under the random strategy, each scheduler node randomly selects one execution node from the qualified candidate resources queried by PID-CAN protocol [14].…”

Section: Experimental Settingmentioning

confidence: 99%

See 2 more Smart Citations

Ex-post efficient resource allocation for Self-organizing Cloud

Wang

Chen

2013

Computers & Electrical Engineering

View full text Add to dashboard Cite

Self-organizing Cloud (SoC) is a very scalable model, which aims to make full use of the geographically distributed computers to provide powerful aggregated computing ability. The resources are provisioned elastically according to user's specific demand, by leveraging virtual machine (VM) resource isolation technology. The resource allocation atop SoC is very challenging in that it is not only an optimization problem over multi-dimensional divisible resources but closely related to economic analysis for coordinating the social competitions. Existing economy-based approaches, however, are commonly ex-ante efficient, such that the participants' decisions may rely on their subjective judgments about their competitors' decisions, leading to the unguaranteed payoffs. Instead, we propose an ex-post efficient resource allocation scheme, which owns three features. (1) Expost win-win effect: under such a scheme, each participant (including consumers and suppliers) will always feel satisfied with their ex-post payoffs. (2) Ex-post incentive compatibility: we can theoretically prove each rational consumer and contributor will always get the optimal payoff if and only if their resource demands and expected prices are truthfully declared. (3) Ex-post maximized efficiency: truly advanced (or more powerful) resources will be allocated and consumed with higher priority, such that the whole system will stay very efficient with maximized resource utilization. Via simulation, our approach can significantly improve the resource contributor's payoffs, also with a high quality of service throughout the global system (including user task's execution efficiency, overall utility, payment level, and fairness of treatment, etc.).

show abstract

“…We can prove that the output of Algorithm 2 is the optimal solution that satisfies the KKT condition (25), in Theorem 2.…”

Section: Lovra Algorithmmentioning

confidence: 99%

Section: Local Optimal Vm Resource Allocation (Lovra) 331 Problem mentioning

confidence: 99%

Section: Experimental Settingmentioning

confidence: 99%

See 1 more Smart Citation

Ex-post efficient resource allocation for Self-organizing Cloud

Wang

Chen

2013

Computers & Electrical Engineering

View full text Add to dashboard Cite

show abstract

“…The main purpose of heuristics is to find out that all tasks are schedulable within the deadline (task feasibility), however they are not responsible for efficient and optimal allocation of tasks. Currently, for interested researchers, several other heuristic based multi-processor scheduling algorithms are suggested and offered in [9], [36], [53], [54] and [55]. The feasibility test of a job on a specific resource is to find out either all the tasks (real-time) in that job will meet their deadlines or not.…”

Section: Multi-processor Schedulingmentioning

confidence: 99%

Energy efficient computing, clusters, grids and clouds: A taxonomy and survey

Zakarya

Gillam

2017

Sustainable Computing: Informatics and Systems

View full text Add to dashboard Cite

“…Increasing time or decreasing time algorithm may be one of the examples of time based scheduling [6].…”

Section: Time Based Schedulingmentioning

confidence: 99%

A Sophisticated Job Scheduling Approach to Minimize the Time Consumption at Computational Cloud

Verma¹,

Gulati²,

Kundra³

2014

IJCA

View full text Add to dashboard Cite

Cloud Computing is an evolving paradigm of this new world. Time complexities have demanded sophisticated scheduling algorithms form the user to prevent the over burden of the cloud servers. Although the cloud servers are fast in comparison to the other platforms of servers but still a good scheduling algorithm would enhance the performance of the job execution. This paper focuses on the creation of a sophisticated job scheduling approach consisted of time constrain algorithms and grouping based algorithm.

show abstract

An Algorithm to Reduce the Time Complexity of Earliest Deadline First Scheduling Algorithm in Real-Time System

Cited by 26 publications

References 23 publications

Ex-post efficient resource allocation for Self-organizing Cloud

Ex-post efficient resource allocation for Self-organizing Cloud

Energy efficient computing, clusters, grids and clouds: A taxonomy and survey

A Sophisticated Job Scheduling Approach to Minimize the Time Consumption at Computational Cloud

Contact Info

Product

Resources

About