Results 311 to 320 of about 106,211 (332)
Some of the next articles are maybe not open access.
Mobile Element Scheduling with Dynamic Deadlines
IEEE Transactions on Mobile Computing, 2007Wireless networks have historically considered support for mobile elements's an extra overhead. However, recent research has provided the means by which a network can take advantage of mobile elements. Particularly in the case of wireless sensor networks, mobile elements can be deliberately built into the system to improve the lifetime of the network ...
Arun A. Somasundara +2 more
openaire +1 more source
Online scheduling of packets with agreeable deadlines
ACM Transactions on Algorithms, 2012This article concerns an online packet scheduling problem that arises as a natural model for buffer management at a network router. Packets arrive at a router at integer time steps, and are buffered upon arrival. Packets have non-negative weights and integer deadlines that are (weakly) increasing in their arrival times.
Lukasz Jez +3 more
openaire +1 more source
Integrated operations scheduling with delivery deadlines
Computers & Industrial Engineering, 2015Delivery deadlines constraints including shipping and processing time.Capacitated suppliers and processing centers.Supplier selection and order assignment.Partial relaxation and threshold based heuristic algorithm.Computational testing in terms of three practical parameters.
Gang Wang 0002, Lei Lei
openaire +1 more source
Scheduling Design of Controllers with Fuzzy Deadline
2005Because some timing-constraints of a controller task may be not determined as a real-time system engineer thinks of, its scheduling with uncertain attributes can not be usually and simply dealt with according to classic manners used in real-time systems. The model of a controller task with fuzzy deadline and its scheduling are studied.
Hong Jin +3 more
openaire +1 more source
On-Line Deadline Scheduling on Multiple Resources
2001We consider an on-line non-preemptive deadline scheduling on multiple resources. Each job has the slack time during which it can wait until its expiration time, the last time it can be started to be completed by the deadline. There are a number of resources on which the jobs are allocated.
Jae-Hoon Kim 0001, Kyung-Yong Chwa
openaire +1 more source
A formal proof of the Deadline Driven scheduler
1994This paper presents an approach to formalizing and proving real-time properties of schedulers. The formal logic that we propose to use is the Duration Calculus [1], and the scheduler that we select here to serve as an example is the Deadline Driven Scheduling Algorithm [2]. The specification and proof of the algorithm are formulated abstractly by using
Zheng Yuhua, Chaochen Zhou
openaire +1 more source
A YARN-based Energy-Aware Scheduling Method for Big Data Applications under Deadline Constraints
Journal of Grid Computing, 2022Fatemeh Shabestari +2 more
exaly
Energy efficient online deadline scheduling.
2010This paper extends the study of online algorithms for energy-efficient deadline scheduling to the overloaded setting. Specifically, we consider a processor that can vary its speed between 0 and a maximum speed T to minimize its energy usage (of which the rate is roughly a cubic function of the speed).
Chan, Ho-Leung +5 more
openaire +3 more sources
Deadline-based scheduling of periodic task systems on multiprocessors
Information Processing Letters, 2002Sanjoy Baruah
exaly