Results 141 to 150 of about 157,797 (184)
Some of the next articles are maybe not open access.

A dynamic priority scheduling algorithm on service request scheduling in cloud computing

Proceedings of 2011 International Conference on Electronic & Mechanical Engineering and Information Technology, 2011
With the popularity of cloud computing, more and more business are operated in the cloud computing. In this paper, we address the problem of service request scheduling in cloud computing systems. We consider the three-tier cloud structure, which consists of resource providers, service providers and consumers.
Zhongyuan Lee, Ying Wang, Wen Zhou
openaire   +1 more source

Priority inversion in dynamic priority driven scheduling algorithms due to imperfect clock synchronization

Proceedings 1996 IEEE Conference on Emerging Technologies and Factory Automation. ETFA '96, 2002
Traditionally, networks supporting hard real-time applications such as process control or manufacturing applications use static scheduling policies for message scheduling within the bus. The main reason for that being the fact that for these applications guarantees must be insured by the network.
L. Ruiz, J.D. Decotignie
openaire   +1 more source

DPS: dynamic priority scheduling heuristic for heterogeneous computing systems

IEE Proceedings - Computers and Digital Techniques, 1998
Scheduling a parallel program is a crucial step in effectively harnessing the computing power of a heterogeneous computing system. Obtaining a minimum finish time schedule for a set of precedence constrained tasks is a well known NP-complete problem.
I. Ahmad, M.K. Dhodhi, R. Ul–Mustafa
openaire   +1 more source

Dynamic priority scheduling-based MAC for wireless sensor networks

International Journal of Sensor Networks, 2007
In this paper, one of the most important issues supporting real-time QoS in wireless sensor networks is discussed, which is fundamentally a challenging problem. A novel MAC protocol based on dynamic priority scheduling is proposed for wireless sensor networks, whose packets competes media with a dynamic priority.
Jiming Chen, Youxian Sun
openaire   +1 more source

Priority-based scheduling of dynamic segment in FlexRay network

2008 International Conference on Control, Automation and Systems, 2008
FlexRay is an in-vehicle communication network for safety-critical automotive applications such as network-based braking or steering systems. The FlexRay protocol offers various benefits over the existing in-vehicle networks by using a hybrid approach integrating the static segment and the dynamic segment.
Kwang-Ho Jung   +3 more
openaire   +1 more source

Multiple finite source queueing model with dynamic priority scheduling

Naval Research Logistics (NRL), 1990
AbstractThis article involves the study of a multiple finite source queueing model with a single server and dynamic, nonpreemptive priority service discipline. The input to the queue is comprised of customers from multiple finite sources. The time which the customers spend at the corresponding sources are exponentially distributed. The service times of
Tosirisuk, Phadhana, Chandra, Jeya
openaire   +1 more source

Dynamic Priority–Dynamic Programming Scheduling Method (DP)2SM: a dynamic approach to resource constraint project scheduling

International Journal of Project Management, 1999
Abstract The purpose of this paper is twofold: first to introduce and evaluate a dynamic priority scheduling model developed in this research for solving the resource constraint project scheduling problem and second, to introduce an improvement made upon the first model by cross-breeding Dynamic Programming with the Dynamic Priority Scheduling Method
openaire   +1 more source

Dynamic- and Static-priority Scheduling of Recurring Real-time Tasks

Real-Time Systems, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Global Dynamic-Priority Scheduling of L&L Tasks

2015
Pfair scheduling is characterized by the fact that tasks are explicitly required to make progress at steady rates. Consider a task in which both the parameters Ci and Ti are positive integers, and suppose that a job of this task is released at time-instant to.
Sanjoy Baruah   +2 more
openaire   +1 more source

A multi-echelon queueing model with dynamic priority scheduling

European Journal of Operational Research, 1994
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gupta, Amit, Webster, Scott
openaire   +2 more sources

Home - About - Disclaimer - Privacy