An improved computational algorithm for round-robin service

Ramos, António; Rego,; Sang, Janche

doi:10.1109/wsc.2003.1261488

“…This is especially true in low-cost systems that lack an operating system (OS) or use a very simple OS. While a full-featured OS such as Linux may use more complex techniques, a round-robin scheduler offers a simple and straightforward way to balance different tasks and share the CPU fairly in a low cost embedded system [5].…”

Section: Introductionmentioning

confidence: 99%

Dynamic round-robin task scheduling to reduce cache misses for embedded systems

Batcher

¹

,

Walker

²

2008

Proceedings of the Conference on Design, Automation and Test in Europe

View full text Add to dashboard Cite

Modern embedded CPU systems rely on a growing number of software features, but this growth increases the memory footprint and increases the need for efficient instruction and data caches. The embedded operating system will often juggle a changing set tasks in a round-robin fashion, which inevitably results in cache misses due to conflicts between different tasks. Our technique reduces cache misses by continuously monitoring CPU cache misses to grade the performance of running tasks. Through a series of step-wise refinements, our software system tunes the round-robin ordering to find a better temporal sequence for the tasks. This tuning is done dynamically during program execution and hence can adapt to changes in work load or external input stimulus. The benefits of this technique are illustrated using an ARM processor running application benchmarks with different cache organizations and round-robin scheduling techniques.

show abstract

Dynamic Round-Robin Task Scheduling to Reduce Cache Misses for Embedded Systems

Batcher¹,

Walker²

2008

2008 Design, Automation and Test in Europe

View full text Add to dashboard Cite

Modern embedded CPU systems rely on a growing number of software features, but this growth increases the memory footprint and increases the need for efficient instruction and data caches. The embedded operating system will often juggle a changing set tasks in a round-robin fashion, which inevitably results in cache misses due to conflicts between different tasks. Our technique reduces cache misses by continuously monitoring CPU cache misses to grade the performance of running tasks. Through a series of step-wise refinements, our software system tunes the round-robin ordering to find a better temporal sequence for the tasks. This tuning is done dynamically during program execution and hence can adapt to changes in work load or external input stimulus. The benefits of this technique are illustrated using an ARM processor running application benchmarks with different cache organizations and round-robin scheduling techniques.

show abstract

LBASMPL: Load balancing adaptive scheduling with minimum packet loss in Wireless Mesh Network

Goyal

¹

,

Kumar

²

2014

2014 IEEE International Conference on Advanced Communications, Control and Computing Technologies

1

0

View full text Add to dashboard Cite

With the enhancement in the wireless technology, the accessing quantity of mobile Internet has increased exponentially. According to the usage quantity of the mobile Internet, the demand of Quality of Service (QoS) is also increased. These type of applications requires high data rate. Wireless Mesh Networks (WMNs) is one of the best example for these type of services. For QoS in the WMNs we proposed a LBASMPL algorithm. It minimize the loss of the packets and send them in the priority manners. The Variable Load Index (VLI), Total Capacity (TC), Estimation of Delay (ED) are also calculated. The traffic is schedule according to Time Division Multiple Access (TDMA). Lower and Upper bound of the link on TC is also calculated. The traffic is load on the link according to priority. For scheduling this traffic matrix is generated. This proposed algorithm is used to minimize the packet loss at the routers and gateway.

show abstract

An improved computational algorithm for round-robin service

Cited by 6 publications

References 5 publications

Dynamic round-robin task scheduling to reduce cache misses for embedded systems

Dynamic round-robin task scheduling to reduce cache misses for embedded systems

Dynamic Round-Robin Task Scheduling to Reduce Cache Misses for Embedded Systems

LBASMPL: Load balancing adaptive scheduling with minimum packet loss in Wireless Mesh Network

Contact Info

Product

Resources

About