Sciweavers

128 search results - page 3 / 26
» A Simple Implementation Technique for Priority Search Queues
Sort
View
REFSQ
2010
Springer
15 years 10 months ago
Binary Priority List for Prioritizing Software Requirements
Product managers in software companies are confronted with a continuous stream of incoming requirements. Due to limited resources they have to make a selection of those that can be...
Thomas Bebensee, Inge van de Weerd, Sjaak Brinkkem...
PE
2008
Springer
109views Optimization» more  PE 2008»
15 years 6 months ago
A conditional probability approach to M/G/1-like queues
Following up on a recently renewed interest in computational methods for M/G/1-type processes, this paper considers an M/G/1-like system in which the service time distribution is ...
Alexandre Brandwajn, Hongyun Wang
HIPC
2007
Springer
15 years 10 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
INFOCOM
1999
IEEE
15 years 10 months ago
Matching Output Queueing with a Combined Input Output Queued Switch
-- The Internet is facing two problems simultaneously: there is a need for a faster switching/routing infrastructure, and a need to introduce guaranteed qualities of service (QoS)....
Shang-Tse Chuang, Ashish Goel, Nick McKeown, Balaj...
ECRTS
2006
IEEE
16 years 16 days ago
Sensitivity Analysis for Fixed-Priority Real-Time Systems
At early stages in the design of real-time embedded applications, the timing attributes of the computational activities are often incompletely specified or subject to changes. Lat...
Enrico Bini, Marco Di Natale, Giorgio C. Buttazzo