Performance analysis of space–time priority queues

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Experimental Study of High Performance Priority Queues

The priority queue is a very important and widely used data structure in computer science, with a variety of applications including Dijkstra’s Single Source Shortest Path algorithm on sparse graph types. This study presents the experimental results of a variety of priority queues. The focus of the experiments is to measure the speed and performance of highly specialized priority queues in out-o...

متن کامل

Performance Evaluation of Approximate Priority Queues

We report on implementation and a modest experimental evaluation of a recently introduced priority queue data structure The new data structure is designed to take advantage of fast operations on machine words and as appropriate reduced key universe size and or tolerance of approximate answers to queries In addition to standard priority queue operations the data structure also supports successor...

متن کامل

Approximate Analysis of General Priority Queues

The present paper deals with the problem of calculating queue length distributions in a priority queueing model with a preemptive-resume policy under the assumption of general arrival and service distributions. The multi-queue priority system is decomposed into single-queue vacation systems, for which the visit and inter-visit distributions are approximated by the idle and busy period of a ΣGI/...

متن کامل

Revisiting priority queues for image analysis

Many algorithms in image analysis require a priority queue, a data structure that holds pointers to pixels in the image, and which allows efficiently finding the pixel in the queue with the highest priority. However, very few articles describing such image analysis algorithms specify which implementation of the priority queue was used. Many assessments of priority queues can be found in the lit...

متن کامل

Time Dependent Priority Queues

Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Performance Evaluation

سال: 2019

ISSN: 0166-5316

DOI: 10.1016/j.peva.2019.04.003