{"title":"Skeap & Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities","abstract":[{"lang":"eng","text":"We propose two protocols for distributed priority queues (denoted by 'heap' for simplicity in this paper) called SKEAP and SEAP. SKEAP realizes a distributed heap for a constant amount of priorities and SEAP one for an arbitrary amount. Both protocols build on an overlay, which induces an aggregation tree on which heap operations are aggregated in batches, ensuring that our protocols scale even for a high rate of incoming requests. As part of SEAP we provide a novel distributed protocol for the k-selection problem that runs in time O(log n) w.h.p. SKEAP guarantees sequential consistency for its heap operations, while SEAP guarantees serializability. SKEAP and SEAP provide logarithmic runtimes w.h.p. on all their operations. \r\nSKEAP and SEAP provide logarithmic runtimes w.h.p. on all their operations with SEAP having to use only O(log n) bit messages."}],"file":[{"date_created":"2019-08-26T09:14:32Z","success":1,"content_type":"application/pdf","file_id":"12954","access_level":"closed","file_name":"p287-feldmann.pdf","date_updated":"2019-08-26T09:14:32Z","relation":"main_file","file_size":1295095,"creator":"ups"}],"date_updated":"2022-01-06T07:03:56Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"has_accepted_license":"1","department":[{"_id":"79"}],"doi":"10.1145/3323165.3323193","date_created":"2019-03-21T14:37:26Z","external_id":{"arxiv":["1805.03472"]},"file_date_updated":"2019-08-26T09:14:32Z","author":[{"full_name":"Feldmann, Michael","last_name":"Feldmann","first_name":"Michael","id":"23538"},{"id":"20792","first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler"}],"publication":"Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","language":[{"iso":"eng"}],"page":"287--296","publisher":"ACM","type":"conference","citation":{"apa":"Feldmann, M., &#38; Scheideler, C. (2019). Skeap &#38; Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities. In <i>Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i> (pp. 287--296). ACM. <a href=\"https://doi.org/10.1145/3323165.3323193\">https://doi.org/10.1145/3323165.3323193</a>","chicago":"Feldmann, Michael, and Christian Scheideler. “Skeap &#38; Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities.” In <i>Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 287--296. ACM, 2019. <a href=\"https://doi.org/10.1145/3323165.3323193\">https://doi.org/10.1145/3323165.3323193</a>.","mla":"Feldmann, Michael, and Christian Scheideler. “Skeap &#38; Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities.” <i>Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, ACM, 2019, pp. 287--296, doi:<a href=\"https://doi.org/10.1145/3323165.3323193\">10.1145/3323165.3323193</a>.","ieee":"M. Feldmann and C. Scheideler, “Skeap &#38; Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities,” in <i>Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2019, pp. 287--296.","bibtex":"@inproceedings{Feldmann_Scheideler_2019, title={Skeap &#38; Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities}, DOI={<a href=\"https://doi.org/10.1145/3323165.3323193\">10.1145/3323165.3323193</a>}, booktitle={Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, publisher={ACM}, author={Feldmann, Michael and Scheideler, Christian}, year={2019}, pages={287--296} }","ama":"Feldmann M, Scheideler C. Skeap &#38; Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities. In: <i>Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. ACM; 2019:287--296. doi:<a href=\"https://doi.org/10.1145/3323165.3323193\">10.1145/3323165.3323193</a>","short":"M. Feldmann, C. Scheideler, in: Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM, 2019, pp. 287--296."},"ddc":["004"],"_id":"8534","status":"public","year":"2019","user_id":"477"}