Optimal Implementation of Two FIFO-Queues in Single-Level Memory
نویسندگان
چکیده
منابع مشابه
Scheduling Tree-Dags Using FIFO Queues: A Control-Memory Tradeo
We study here a combinatorial problem that is motivated by a genre of architecture independent scheduler for parallel computations Such schedulers are often used for instance when computations are being done by a cooperating network of workstations The results we obtain expose a control memory tradeo for such schedulers when the computation being scheduled has the structure of a complete binary...
متن کاملFast and Scalable k-FIFO Queues
We introduce fast and scalable algorithms that implement boundedand unbounded-size, lock-free, linearizable k-FIFO queues with empty (and full) check. Logically, a k-FIFO queue can be understood as queue where each element may be dequeued out-of-order up to k− 1 or as pool where each element is dequeued within a k-bounded number of dequeue operations. We show experimentally that there exist opt...
متن کاملFinite Moments of Workload Components in FIFO Multiserver Queues
Previously established necessary and sufficient conditions for finite stationary moments in stable FIFO GI/GI/s queues exist only for the first component of the workload vector, the delay. In this paper, we derive moment results for all the components of the stationary workload vector in stable FIFO GI/GI/s queues. As in the case of stationary delay, the moment conditions for workload component...
متن کاملA Class of FIFO Queues Arising in Computer Systems
., Secondary memory devices are modeled as single server queueing systems. The non-random access to data within these devices is explicitly accounted for, as " se tupH times. Requests are typed by the location of the desired record. No distinction is made between 'read' and 'write' requests. Each request is assumed to be satisfiable from one location on the device (e.g. a single directory searc...
متن کاملScheduling Tree-Dags Using FIFO Queues: A Control-Memory Trade-Off
We study here a combinatorial problem that is motivated by a genre of architecture-independent scheduler for parallel computations. Such schedulers are often used, for instance, when computations are being done by a cooperating network of workstations. The results we obtain expose a control-memory tradeoo for such schedulers, when the computation being scheduled has the structure of a complete ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics
سال: 2011
ISSN: 2152-7385,2152-7393
DOI: 10.4236/am.2011.210180