Zobrazeno 1 - 10
of 245
pro vyhledávání: '"Double-ended priority queue"'
Autor:
Moshe Haviv
Publikováno v:
Performance Evaluation. 103:60-68
Queues in which customers who belong to different classes have different priority levels is an old subject. Usually one looks for the performance of each class given its priority level. We suggest here a new model. Specifically, we consider the M/G/1
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b24e2af20167e55995e179ddaf4ea9f7
https://doi.org/10.1016/j.peva.2016.08.001
https://doi.org/10.1016/j.peva.2016.08.001
Publikováno v:
Similarity Search and Applications ISBN: 9783319684734
SISAP
SISAP
Content-based similarity search techniques have been employed in a variety of today applications. In our work, we aim at the scenario when the similarity search is applied in the context of stream processing. In particular, there is a stream of query
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::484f418735ebd0e573a4ea31527acf82
https://doi.org/10.1007/978-3-319-68474-1_2
https://doi.org/10.1007/978-3-319-68474-1_2
Publikováno v:
Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC '17)
PODC
PODC
Consider the following random process: we are given $n$ queues, into which elements of increasing labels are inserted uniformly at random. To remove an element, we pick two queues at random, and remove the element of lower label (higher priority) amo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dc860832758d49434503f5ccc2392640
https://hdl.handle.net/20.500.11850/192238
https://hdl.handle.net/20.500.11850/192238
Publikováno v:
SPAA
A recursive and fast construction of an n -element priority queue from exponentially smaller hardware priority queues and size n RAM is presented. All priority queue implementations to date require either O ( log n ) instructions per operation or, ex
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1161004b4a5c7eb26c83d94a2c46e327
https://doi.org/10.1016/j.comnet.2014.03.010
https://doi.org/10.1016/j.comnet.2014.03.010
Publikováno v:
Queueing Systems. 77:297-330
We are interested in queues in which customers of different classes arrive to a service facility, and where performance targets are specified for each class. The manager of such a queue has the task of implementing a queueing discipline that results
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ec59fba1f23efad0f8522d8fa2a05696
https://doi.org/10.1007/s11134-013-9382-6
https://doi.org/10.1007/s11134-013-9382-6
Publikováno v:
Performance Evaluation. 70:948-964
For garbage-collected applications, dynamically-allocated objects are contained in a heap. Programmer productivity improves significantly if there is a garbage collector to automatically deallocate objects that are no longer needed by the application
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f9a6e1e8b59b7e8a2aa28c403751a839
https://doi.org/10.1016/j.peva.2013.05.009
https://doi.org/10.1016/j.peva.2013.05.009
Publikováno v:
Science of Computer Programming
Accurately predicting the dynamic memory consumption (or heap space) of programs can be critical during software development. It is well-known that garbage collection (GC) complicates such problem. The peak heap consumption of a program is the maximu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::15ccba7774da1371701483a5572733c4
https://doi.org/10.1016/j.scico.2012.10.008
https://doi.org/10.1016/j.scico.2012.10.008
Publikováno v:
RTSS
Recent years have seen the emergence of wireless cyber-physical systems that must support real-time queries of physical environments through wireless sensor networks. This paper proposes Real-Time Query Scheduling (RTQS), a novel approach to conflict
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bef730a7bb53becb2a59234a55116ea6
https://doi.org/10.1109/tc.2012.172
https://doi.org/10.1109/tc.2012.172
Autor:
Yuan Hu
Publikováno v:
Applied Mechanics and Materials. :2122-2127
In many applications, it is necessary to adjust the node position of complete binary tree, making the data set have the nature of heap. Because when binary tree node data volume is huge, it will be needed apparently for heap adjustment efficiency of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::327d8ef5b2f10739565041d041e07d62
https://doi.org/10.4028/www.scientific.net/amm.321-324.2122
https://doi.org/10.4028/www.scientific.net/amm.321-324.2122
Publikováno v:
Eenberg, K, Larsen, K G & Yu, H 2017, DecreaseKeys are expensive for external memory priority queues . in STOC 2017-Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing . vol. Part F128415, Association for Computing Machinery, New York, NY, pp. 1081-1093, 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, Canada, 19/06/2017 . https://doi.org/10.1145/3055399.3055437
STOC
STOC
One of the biggest open problems in external memory data structures is the priority queue problem with DecreaseKey operations. If only Insert and ExtractMin operations need to be supported, one can design a comparison-based priority queue performing
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e9ba578caa17328b64e907faecdc233c
http://arxiv.org/abs/1611.00911
http://arxiv.org/abs/1611.00911