@misc{GuoSekerinski22ConcurrentOrderMaintenancePreprint,
	title = {New {Concurrent} {Order} {Maintenance} {Data} {Structure}},
	doi = {10.48550/arXiv.2208.07800},
	abstract = {The Order-Maintenance (OM) data structure maintains a total order list of items for insertions, deletions, and comparisons. 
As a basic data structure, OM has many applications, such as maintaining the topological order, core numbers, and truss in graphs, and maintaining ordered sets in Unified Modeling Language (UML) Specification.
The prevalence of multicore machines suggests parallelizing such a basic data structure. This paper proposes a new parallel OM data structure that supports insertions, deletions, and comparisons in parallel. 
Specifically, parallel insertions and deletions are synchronized by using locks efficiently, which achieve up to 7x and 5.6x speedups with 64 workers.
One big advantage is that the comparisons are lock-free so that they can execute highly in parallel with other insertions and deletions, which achieve up to 34.4x speedups with 64 workers.
Typical real applications maintain order lists that always have a much larger portion of comparisons than insertions and deletions. For example, in core maintenance, the number of comparisons is up to 297 times larger compared with insertions and deletions in certain graphs. 
This is why the lock-free order comparison is a breakthrough in practice.},
	author = {Guo, Bin and Sekerinski, Emil},
	month = aug,
	year = {2022},
	note = {Pages: 11},
}

{"_id":"sP76LmjtuxXRDRTBE","bibbaseid":"guo-sekerinski-newconcurrentordermaintenancedatastructure-2022","author_short":["Guo, B.","Sekerinski, E."],"bibdata":{"bibtype":"misc","type":"misc","title":"New Concurrent Order Maintenance Data Structure","doi":"10.48550/arXiv.2208.07800","abstract":"The Order-Maintenance (OM) data structure maintains a total order list of items for insertions, deletions, and comparisons. As a basic data structure, OM has many applications, such as maintaining the topological order, core numbers, and truss in graphs, and maintaining ordered sets in Unified Modeling Language (UML) Specification. The prevalence of multicore machines suggests parallelizing such a basic data structure. This paper proposes a new parallel OM data structure that supports insertions, deletions, and comparisons in parallel. Specifically, parallel insertions and deletions are synchronized by using locks efficiently, which achieve up to 7x and 5.6x speedups with 64 workers. One big advantage is that the comparisons are lock-free so that they can execute highly in parallel with other insertions and deletions, which achieve up to 34.4x speedups with 64 workers. Typical real applications maintain order lists that always have a much larger portion of comparisons than insertions and deletions. For example, in core maintenance, the number of comparisons is up to 297 times larger compared with insertions and deletions in certain graphs. This is why the lock-free order comparison is a breakthrough in practice.","author":[{"propositions":[],"lastnames":["Guo"],"firstnames":["Bin"],"suffixes":[]},{"propositions":[],"lastnames":["Sekerinski"],"firstnames":["Emil"],"suffixes":[]}],"month":"August","year":"2022","note":"Pages: 11","bibtex":"@misc{GuoSekerinski22ConcurrentOrderMaintenancePreprint,\n\ttitle = {New {Concurrent} {Order} {Maintenance} {Data} {Structure}},\n\tdoi = {10.48550/arXiv.2208.07800},\n\tabstract = {The Order-Maintenance (OM) data structure maintains a total order list of items for insertions, deletions, and comparisons. \nAs a basic data structure, OM has many applications, such as maintaining the topological order, core numbers, and truss in graphs, and maintaining ordered sets in Unified Modeling Language (UML) Specification.\nThe prevalence of multicore machines suggests parallelizing such a basic data structure. This paper proposes a new parallel OM data structure that supports insertions, deletions, and comparisons in parallel. \nSpecifically, parallel insertions and deletions are synchronized by using locks efficiently, which achieve up to 7x and 5.6x speedups with 64 workers.\nOne big advantage is that the comparisons are lock-free so that they can execute highly in parallel with other insertions and deletions, which achieve up to 34.4x speedups with 64 workers.\nTypical real applications maintain order lists that always have a much larger portion of comparisons than insertions and deletions. For example, in core maintenance, the number of comparisons is up to 297 times larger compared with insertions and deletions in certain graphs. \nThis is why the lock-free order comparison is a breakthrough in practice.},\n\tauthor = {Guo, Bin and Sekerinski, Emil},\n\tmonth = aug,\n\tyear = {2022},\n\tnote = {Pages: 11},\n}\n\n","author_short":["Guo, B.","Sekerinski, E."],"key":"GuoSekerinski22ConcurrentOrderMaintenancePreprint","id":"GuoSekerinski22ConcurrentOrderMaintenancePreprint","bibbaseid":"guo-sekerinski-newconcurrentordermaintenancedatastructure-2022","role":"author","urls":{},"metadata":{"authorlinks":{}}},"bibtype":"misc","biburl":"https://api.krunk.cn/emil/bib.php","dataSources":["So4gmSWFmbQRNEuFs","MF5eGzpJnqf6bSAoG","ezsmw4w22u9JFLNYJ","CvQYP6Tmpapx74Mgr","RWydLHbBJqgdeh5jr"],"keywords":[],"search_terms":["new","concurrent","order","maintenance","data","structure","guo","sekerinski"],"title":"New Concurrent Order Maintenance Data Structure","year":2022}