Sciweavers

79 search results - page 10 / 16
» Queues, stores, and tableaux
Sort
View
CPE
1997
Springer
79views Hardware» more  CPE 1997»
14 years 3 months ago
Storage Alternatives for Large Structured State Spaces
We consider the problem of storing and searching a large state space obtained from a high-level model such as a queueing network or a Petri net. After reviewing the traditional te...
Gianfranco Ciardo, Andrew S. Miner
ICWE
2010
Springer
14 years 3 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...
HOTI
2005
IEEE
14 years 4 months ago
Addressing Queuing Bottlenecks at High Speeds
Modern routers and switch fabrics can have hundreds of input and output ports running at up to 10 Gb/s; 40 Gb/s systems are starting to appear. At these rates, the performance of ...
Sailesh Kumar, Jonathan S. Turner, Patrick Crowley
EURONGI
2006
Springer
14 years 2 months ago
Job Scheduling for Maximal Throughput in Autonomic Computing Systems
Abstract. Autonomic computing networks manage multiple tasks over a distributed network of resources. In this paper, we view an autonomic computing system as a network of queues, w...
Kevin Ross, Nicholas Bambos
PODS
2006
ACM
217views Database» more  PODS 2006»
14 years 11 months ago
A simpler and more efficient deterministic scheme for finding frequent items over sliding windows
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
Lap-Kei Lee, H. F. Ting