Sciweavers

456 search results - page 66 / 92
» Alternative priority scheduling in dynamic priority systems
Sort
View
ICALP
2001
Springer
14 years 1 days ago
Online Packet Routing on Linear Arrays and Rings
In contrast to classical offline k-k routing, the online packet routing problem allows for an arbitrary number of packets with arbitrary end points and release times. We study this...
Jessen T. Havill
GRID
2007
Springer
14 years 1 months ago
Eliciting honest value information in a batch-queue environment
Abstract— Markets and auctions have been proposed as mechanisms for efficiently and fairly allocating resources in a number of different computational settings. Economic approac...
Andrew Mutz, Richard Wolski, John Brevik
RTAS
2008
IEEE
14 years 1 months ago
Bounding Worst-Case Response Time for Tasks with Non-Preemptive Regions
Real-time schedulability theory requires a priori knowledge of the worst-case execution time (WCET) of every task in the system. Fundamental to the calculation of WCET is a schedu...
Harini Ramaprasad, Frank Mueller
ADAEUROPE
2004
Springer
14 years 29 days ago
The Chance for Ada to Support Distribution and Real-Time in Embedded Systems
This paper presents a modification of GLADE —the current GNAT implementation of the Ada 95 Distributed Systems Annex (DSA)— to support the development of distributed applicatio...
Juan López Campos, J. Javier Gutiérr...
ICDE
2011
IEEE
222views Database» more  ICDE 2011»
12 years 11 months ago
Dynamic prioritization of database queries
— Enterprise database systems handle a variety of diverse query workloads that are of different importance to the business. For example, periodic reporting queries are usually mi...
Sivaramakrishnan Narayanan, Florian Waas