Results 231 to 240 of about 156,709 (282)
Some of the next articles are maybe not open access.

A dynamic priority rule for scheduling against due‐dates

Journal of Operations Management, 1982
AbstractWe simulate the performance of a simple production system in which due‐dates are set internally. We investigate priority rules aimed at minimizing tardiness, emphasizing a “modified duedate rule” which functions effectively in conjunction with internally‐set deadlines and which adapts to both tight and loose conditions in the due‐dates.
Baker, K.R., Bertrand, J.W.M.
openaire   +2 more sources

Dynamic priorities, priority scheduling and priority inheritance

ACM SIGAda Ada Letters, 1990
Scheduling requirements are a major portion of the set of requirements that must be addressed by the Ada 9X Project. This is evident by the numerous Revision Requests (RRs) submitted (over 25) to the Ada 9X Project Office and the subsequent Revision Issues (RI-7005 and RI-7007). The related 9X requirements are:
openaire   +1 more source

Global Dynamic Priority Scheduling

2015
In this chapter, we briefly describe the research that had been conducted in the dynamic-priority scheduling of systems of three-parameter sporadic tasks. In contrast to the situation with respect to Liu and Layland task systems (Chap. 7) where there is a very large body of work to discuss, the research on dynamic priority (DP) scheduling of three ...
Sanjoy Baruah   +2 more
openaire   +1 more source

Dynamic priority scheduling for heterogeneous cognitive radio networks

2012 9th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON), 2012
In cognitive radio networks (CRNs), secondary networks (SNs) are regulated in order to prevent them from accessing a channel if primary networks (PNs) are currently occupying the channel. However, there not exists any regulation how to coordinate the channel access among multiple heterogeneous SNs.
Boram Choi   +3 more
openaire   +1 more source

Dynamic multilevel priority packet scheduling design for WSN

2014 International Conference on Signal Propagation and Computer Technology (ICSPCT 2014), 2014
In wireless sensor network (WSN) we need to schedule different types of packets, Such as real time and non real time packets with some restrictions on resources. There are lots of existing packet scheduling mechanism of wireless sensor network uses first come first serve (FCFS), preemptive priority and non-preemptive priority scheduling algorithm.
Varsha Jain   +2 more
openaire   +1 more source

Heterogeneous Dynamic Priority Scheduling in Time Critical Applications

International Journal of Wireless Networks and Broadband Technologies, 2012
In the unlicensed band, the notion of primary user and secondary user (To implement cognitive radio) is not explicit. By dynamic priority assignment the authors propose to implement cognitive radio in the unlicensed band. In time critical events, the data which is most important, has to be given the time slots.
Arvind Viswanathan   +2 more
openaire   +1 more source

Dynamic Priority Scheduling Mechanism through Adaptive InterFrame Space

2007 International Conference on Wireless Communications, Networking and Mobile Computing, 2007
The increasing demand of multimedia applications in wireless local area networks (WLAN) has led to the attempt to provide quality of service for differentiated traffics in WLAN. In this paper, a novel mechanism, Adaptive IFS through Transmission Delay (AITD) is introduced; to dynamically adjust the inter-frame space (IFS) based on differentiation ...
Reza Ghazizadeh, Pingzhi Fan
openaire   +1 more source

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

Home - About - Disclaimer - Privacy