Sciweavers

130 search results - page 13 / 26
» A Parallel Priority Queue with Constant Time Operations
Sort
View
USENIX
2001
14 years 10 months ago
Scalable Linux Scheduling
For most of its existence, Linux has been used primarily as a personal desktop operating system. Yet, in recent times, its use as a cost-efficient alternative to commercial operat...
Stephen Molloy, Peter Honeyman
ICWE
2010
Springer
15 years 2 months ago
AWAIT: Efficient Overload Management for Busy Multi-tier Web Services under Bursty Workloads
:  AWAIT: Efficient Overload Management for Busy Multi-tier Web Services under Bursty Workloads Lei Lu, Ludmila Cherkasova, Vittoria de Nitto Persone, Ningfang Mi, Evgenia Smirn...
Lei Lu, Ludmila Cherkasova, Vittoria de Nitto Pers...
79
Voted
SPE
2002
119views more  SPE 2002»
14 years 9 months ago
HARTEX - a safe real-time kernel for distributed computer control systems
: The paper presents a hard real-time kernel for distributed computer control systems (DCCS) highlighting a number of novel features, such as integrated scheduling of hard and soft...
C. K. Angelov, I. E. Ivanov, Alan Burns
ESA
2006
Springer
136views Algorithms» more  ESA 2006»
15 years 1 months ago
Approximation in Preemptive Stochastic Online Scheduling
Abstract. We present a first constant performance guarantee for preemptive stochastic scheduling to minimize the sum of weighted completion times. For scheduling jobs with release ...
Nicole Megow, Tjark Vredeveld
ALGORITHMICA
2010
112views more  ALGORITHMICA 2010»
14 years 9 months ago
On Sorting, Heaps, and Minimum Spanning Trees
Let A be a set of size m. Obtaining the first k m elements of A in ascending order can be done in optimal O(m + k log k) time. We present Incremental Quicksort (IQS), an algorith...
Gonzalo Navarro, Rodrigo Paredes