Results 261 to 270 of about 34,037 (308)
Some of the next articles are maybe not open access.
Alternative priority scheduling in dynamic priority systems
Proceedings of ICECCS '96: 2nd IEEE International Conference on Engineering of Complex Computer Systems (held jointly with 6th CSESAW and 4th IEEE RTAW), 2002The major drawback of the slack-stealing based schedulings for aperiodic requests is a high computational complexity to calculate the slack which in consequence makes them not be practical. In this paper, we present a soft-aperiodic task scheduling algorithm, called Alternative Priority Scheduling (APS), which has a simple slack calculation method in ...
Hyungill Kim +2 more
openaire +1 more source
2011
In real-time systems, the capability to achieve short or even predictable reaction times is essential. In this paper, we take a pragmatic approach by proposing priority-based scheduling in SDL combined with a mechanism to suspend and resume SDL agents. More specifically, we define adequate syntactical extensions of SDL and show that they are compliant ...
Dennis Christmann +2 more
openaire +1 more source
In real-time systems, the capability to achieve short or even predictable reaction times is essential. In this paper, we take a pragmatic approach by proposing priority-based scheduling in SDL combined with a mechanism to suspend and resume SDL agents. More specifically, we define adequate syntactical extensions of SDL and show that they are compliant ...
Dennis Christmann +2 more
openaire +1 more source
Static-priority scheduling on multiprocessors
Proceedings 22nd IEEE Real-Time Systems Symposium (RTSS 2001) (Cat. No.01PR1420), 2005The preemptive scheduling of systems of periodic tasks on a platform comprised of several identical processors is considered. A scheduling algorithm is proposed for static-priority scheduling of such systems; this algorithm is a simple extension of the uniprocessor rate-monotonic scheduling algorithm.
Björn Andersson +2 more
openaire +1 more source
A priority scheduling for TM pathologies
The Journal of Supercomputing, 2014Developing a parallel program on Chip multi-processors (CMPs) is a critical and difficult issue. To overcome the synchronization obstacles of CMPs, transactional memory (TM) has been proposed as an alternative control concurrency mechanism, instead of using traditional lock synchronization.
Chia-Jung Chen, Rong-Guey Chang
openaire +1 more source
Extending the semantics of scheduling priorities
Communications of the ACM, 2012Increasing parallelism demands new paradigms.
openaire +1 more source
A real time priority scheduler
Proceedings of the 1966 21st national conference on -, 1966The real time priority scheduler reported herein evolved from a design effort to provide software aids for handling the interrupts that occur in hybrid computation. Since these interrupts are both internal and external (i.e., generated internal and external respectively to the digital portion of the computer), hybrid computation is representative of ...
Karl Ramsay, Jon C. Strauss
openaire +1 more source
Fairness via priority scheduling
2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2013In the context of multi-agent resource allocation problems, fairness is a paradigm shift in the recent past. An efficient scheduler always allocates resources to the `best' agent. Some of the agents, who are most often in `bad' conditions, are starved and fair schedulers are defined in this context.
Veeraruna Kavitha +2 more
openaire +1 more source
Routing sensitive priority scheduling
Proceedings of the First ACM workshop on Sensor and actor networks, 2007In this paper, we demonstrate a new CPU-scheduling algorithm which especially takes routing issues into account. In the priority scheduling [1], an approach known for solving the overloading problem of simple FIFO CPU-scheduling, it is not guaranteed that nodes close to the base station will get fair chance to send their own packets if forwarding ...
Fadi Tirkawi, Stefan Fischer 0001
openaire +1 more source
Priority scheduling of requests to web portals
Journal of Systems and Software, 2009Web portals work as a point of access to a large volume of information on the web. This paper focuses on the performance of Web portals in an E-commerce environment which involves the processing of a large number of users' requests. It proposes a class-based priority scheme which classifies users' requests into high and low priorities.
D. R. W. Holton +2 more
openaire +1 more source
Priority Queues Are Not Good Concurrent Priority Schedulers
2015The need for priority scheduling arises in many algorithms. In these algorithms, there is a dynamic pool of lightweight, unordered tasks, and some execution orders are more efficient than others. Therefore, each task is given an application-specific priority that is a heuristic measure of its importance for early scheduling, and the runtime system ...
Andrew Lenharth +2 more
openaire +1 more source