An optimal priority assignment policy is presented for independent aperiodic tasks with arbitrary ready times and firm deadlines, scheduled on a uniprocessor along with a set of hard periodic/sporadic tasks. The latter tasks are assumed to have been assigned unique fixed priorities according to some arbitrary policy and guaranteed, via off-line feasibility analysis, to meet their deadlines. In ...

: The present paper proposes a new model for priority assignment to the incoming call connection request for all optical WDM communication, adopting standard queuing theory concept. The model has been proposed for three different levels of call connection priorities, categorizing them into three types of signals as type0, type1 and type2 according to increasing priority, and generation probabil...

We present a new iterative mathematical model for calculating the average bandwidth assigned to traffic flows using a Weighted Round Robin with Priority queuing (WRRPQ) scheduler with both strict and rate controlled priority in IP based NGN networks. The bandwidth assignment estimation is based on the average packet length, link speed and the arrival rate. We prove the model outcome with exampl...

Background Different strategies for addressing the challenge of prioritizing elective patients efficiently and fairly have been introduced in Norway. In the time period studied, there were three possible outcomes for elective patients that had been through the process of priority setting: (i) high priority with assigned individual maximum waiting time; (ii) low priority without a maximum waitin...

This paper presents an offline collision-free path planning algorithm for multiple mobile robots using a 2D spatial-time map. In this decoupled approach, a centralized planner uses a SpatioTemporal A* algorithm to find the lowest time cost path for each robot in a sequentially order based on its assigned priority. Improvements in viable path solutions using wait time insertion and adaptive prio...

Received Nov 4, 2014 Revised Jan 5, 2015 Accepted Feb 5, 2015 Test Case Prioritization (TCP) has gained wide spread acceptance as it often results in good quality software free from defects. Due to the increase in rate of faults in software traditional techniques for prioritization results in increased cost and time. Main challenge in TCP is difficulty in manually validate the priorities of dif...

Introduction As electronic messaging grew, it quickly became evident that some messages were more time critical than others. With this realization, a message priority scheme was instituted. Military torn-tape relays typically used four or five levels of priority, from low priority to high, such as routine, priority, immediate and flash. It was a general tenet of operation, that once a priority ...

Carrier sense multiple access and its variants have been widely used in mobile ad hoc networks. However, such access cannot guarantee the quality of real-time traÆc. This paper presents a distributed medium access control protocol that provides priority based multimedia access to wireless ad hoc networks. First, a priority classi cation scheme is used to distinguish the higher-priority frames (...

In development process developers need to prioritize inconsistencies to identify the actions taken to handle inconsistency and to measure the impact of inconsistency-handling actions which is a key to effective action in the presence of inconsistencies. However, different stakeholders may assign different levels of priority to the same shared requirements from their own perspectives. The disagr...

A wireless ad-hoc network is a self-organized wireless network without fixed or backbone infrastructure. All nodes have routing capability and use peer-to-peer packet transmission or forward packets to other node using multi hop communication. Now days mobile ad-hoc networks are being used for different applications and traffics, so it require quality of service (QoS) support in routing protoco...