Results 21 to 30 of about 106,211 (332)
PLoS ONE, 2019 To solve the problem of the deadline-constrained task scheduling in the cloud computing system, this paper proposes a deadline-constrained scheduling algorithm for cloud computing based on the driver of dynamic essential path (Deadline-DDEP).
Xia Shao +3 more
doaj +1 more source
Improvement of the Dynamic Priority Scheduling Algorithm Based on a Heapsort
IEEE Access, 2019 The earliest deadline first (EDF) scheduling algorithm is a typical representative of the dynamic priority scheduling algorithm. However, once the system is overloaded, the deadline miss rate increases and the scheduling performance deteriorates sharply,
Shanshan Meng, Qiang Zhu, Fei Xia
doaj +1 more source
Scheduling Multipacket Frames with Frame Deadlines [PDF]
Journal of Scheduling, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lukasz Jez +2 more
openaire +2 more sources
Scheduling Spark Tasks With Data Skew and Deadline Constraints
IEEE Access, 2021 Data skew has an essential impact on the performance of big data processing. Spark task scheduling with data skew and deadline constraints is considered to minimize the total rental cost in this paper.
Haihua Gu, Xiaoping Li, Zhipeng Lu
doaj +1 more source
Aggressive Online Deadline Scheduling
Electronic Notes in Theoretical Computer Science, 2004 AbstractThis paper is concerned with online algorithms for scheduling jobs with deadlines on a single processor. It has been known for long that unless the system is underloaded, no online scheduling algorithm can be 1-competitive, i.e., matching the performance of the optimal offline algorithm.
Tak Wah Lam +3 more
openaire +3 more sources
Adaptive Network Coding for Scheduling Real-time Traffic with Hard Deadlines [PDF]
, 2012 We study adaptive network coding (NC) for scheduling real-time traffic over a single-hop wireless network. To meet the hard deadlines of real-time traffic, it is critical to strike a balance between maximizing the throughput and minimizing the risk that ...
Li, Jason Hongjun +3 more
core +1 more source
Nonmigratory Online Deadline Scheduling on Multiprocessors [PDF]
SIAM Journal on Computing, 2005 Summary: We consider multiprocessor scheduling with hard deadlines and investigate the cost of eliminating migration in the online setting. Let \(I\) be any set of jobs that can be completed by some migratory offline schedule on \(m\) processors.
Ho-Leung Chan, Tak Wah Lam, Kar-Keung To
openaire +6 more sources
Resource allocation and scheduling of multiple composite web services in cloud computing using cooperative coevolution genetic algorithm [PDF]
, 2011 In cloud computing, resource allocation and scheduling of multiple composite web services is an important and challenging problem. This is especially so in a hybrid cloud where there may be some low-cost resources available from private clouds and some ...
Ai, Lifeng, Fidge, Colin, Tang, Maolin
core +2 more sources
On-line scheduling with tight deadlines
Theoretical Computer Science, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chiu-Yuen Koo +4 more
openaire +4 more sources
Study on Scientific Workflow Scheduling Based on Fuzzy Theory Under Edge Environment [PDF]
Jisuanji kexue, 2022 As a novel computing paradigm,edge computing has become a significant approach to solve large-scale scientific applications.Aiming at scientific workflow scheduling under edge environment,task computation time and data transmission time are uncertain due
LIN Chao-wei, LIN Bing, CHEN Xing
doaj +1 more source