We consider the telematics appliances, such as firewall, as a basic part of security system with specific preemptive priority queuing and access control algorithm oriented on multi-core implementation. Proposed randomized push-out buffer management mechanism with α parameter allows tuning very efficiently the loss probability of priority packets and the time they spend in queue as the factors u...

This paper studies a new multi-objective fuzzy optimization prob- lem. The objective function of this study has dierent levels. Therefore, a suitable optimized solution for this problem would be an optimized solution with preemptive priority. Since, the feasible domain is non-convex; the tra- ditional methods cannot be applied. We study this problem and determine some special structures related...

Abstract Timing verification of multi-core systems is complicated by contention for shared hardware resources between co-running tasks on different cores. This paper introduces the Multi-core Resource Stress and Sensitivity (MRSS) task model that characterizes how much stress each places it sensitive to such resource stress. facilitates a separation concerns, thus retaining advantages tradition...

In this paper considers M[X1]/G1/1, M[X2]/G2/1 , M[X3]/G3/1 general queueing system with priority services . Three types of customers from different classes arrive at the in independent Poisson process. The server follows non preemptive rule subject to working breakdown, and modified Bernoulli vacation (arbitrary) periods. After completing service, if there is no high present system. time depen...

This paper presents a procedure for estimating the mean access delay of calls in Public Access Mobile Radio (PAMR) trunking systems. For this purpose, an approximation of the mean waiting time in the M/G/C queue w ith non-preemptive priority is developed and numerically tested. The proposed approximation is based on other existing approximations and has been tested for the conditions commonly f...

In a typical resource allocation model, clients request a xed amount of a certain resource from the resource manager (RM). Based on the current allocations, the RM grants or rejects the request. An alternative abstract model for the resource allocation problem assumes that the client speciies his request as a range of possible allocations rather than a xed point requirement. The client is assum...

In real-time systems fixed priority scheduling techniques are considered superior than the dynamic priority counterparts from implementation perspectives; however the dynamic priority assignments dominate the fixed priority mechanism when it comes to system utilization. Considering this gap, a number of results are added to real-time system literature recently that achieve higher utilization at...

In this paper we present a queueing model for the performance analysis of ABR tra c in ATM networks. We consider a multi-channel service station with two types of customers, the rst having preemptive priority over the second. The arrivals occur according to two independent Poisson processes and the service times are assumed to be exponentially distributed. Each type-1 customer requires a single...

Hierarchical scheduling (HS) systems manage a set of realtime applications through a scheduling hierarchy, enabling partitioning and reduction of complexity, confinement of failure modes, and temporal isolation among system applications. This plays a crucial role in all industrial areas where high-performance microprocessors allow growing integration of multiple applications on a single platfor...

We consider a two-class M " A2 IMI'11 preemptive priority queue in which there are two essential on-line decisions that have to be taken. The first is the decision to either accept or reject new type-lor type-2 jobs. The second is the decision to abort jobs, i.e., to remove any type-lor type-2 jobs from the system. We show that there exist optimal threshold policies for these two types of decis...