Traditionally, real-time scheduling algorithms prioritize tasks solely based on their timing parameters and cannot effectively handle tasks that have different execution preferences . In this paper, for a set of periodic real-time tasks running on a single processor, where some tasks are preferably executed as soon as possible (ASAP) and others as late as possible (ALAP) , we investigate Prefer...

Incremental methods can be used to produce implementations rapidly and to facilitate multi-level design optimisation. This paper describes a declarative framework, based on the language Ruby, that supports incremental design and validation of custom computers. The key elements of the approach include parameterised descriptions, design transformation and data refinement. Several priority queue d...

This paper addresses the problem of scheduling periodic messages in demand priority network standardized by IEEE 802.12 Committee. As regards the real-time property of the demand priority network, unnecessary blocking time due to its round-robin-based MAC protocol may cause periodic messages to miss their hard deadlines and result in low schedulability of periodic messages. We propose a new mes...

Recently, several wireless/optical datacenter architectures are designed to overcome the drawbacks of wired datacenter topologies, such as expensive highend switches, high cabling complexity, congestion caused by a few hot nodes. Compared with wired switches, current commodity wireless switches usually suffer lower throughput as well as higher packet loss ratio and latency. However, todays data...

This paper addresses the problem of real-time scheduling of a set of sporadic tasks on uniand multiprocessor platform based on priority promotion. A new preemptive scheduling algorithm, called Fixed-Priority with Priority Promotion (FPP), is proposed. In FPP scheduling, tasks are executed similar to traditional fixed-priority (FP) scheduling but the priority of some tasks are promoted at fixed ...

Corresponding Author: Booba, B., Research Scholar, Anna University, Chennai, Tamil Nadu, India Email: [email protected] Abstract: The packet scheduling is essential and plays an important role to sense the element nodes with resource constraints in Wireless Networks. The packet scheduling scheme also scale the energy consumption and end-to-end information transmission delay in time period and ...

11 Differentiated services (DiffServ) is a promising architecture for the next generation Internet due to its scalable and 12 flexible design. In DiffServ, scheduling disciplines play an important role in achieving service differentiation. In this 13 paper, we extend the average delay analysis of the probabilistic priority (PP) scheduling discipline first proposed in 14 [Proc. 2001 IEEE Worksho...

Differentiated services (DiffServ) is a promising architecture for the next generation Internet due to its scalable and flexible design. In DiffServ, scheduling disciplines play an important role in achieving service differentiation. In this paper, we extend the average delay analysis of the probabilistic priority (PP) scheduling discipline first proposed in [Proc. 2001 IEEE Workshop on High Pe...

In this paper we propose Scheduling which is a decision making process which deals with the allocation of resources to tasks over given time periods. Scheduling is done by scheduler and dispatcher. A scheduler is a person or machine that organizes or maintains schedules. A dispatcher is a module which gives control of CPU to the process selected by the scheduler. In this paper we propose using ...

— The need for better quality of service is growing as new quality sensitive services are becoming more and more important in data networks. The key element in providing quality-of-service or gradeof-service in packet networks is deciding when or in what order the incoming packets should depart the system. In other words the departing packets have to be somehow scheduled. Implementing this sche...