תקציר
Most concurrent data structures being designed today are versions of known sequential data structures. However, in various cases it makes sense to relax the semantics of traditional concurrent data structures in order to get simpler and possibly more efficient and scalable implementations. For example, when solving the classical producer-consumer problem by implementing a concurrent queue, it might be enough to allow the dequeue operation (by a consumer) to return and remove one of the two oldest values in the queue, and not necessarily the oldest one. We define infinitely many possible relaxations of several traditional data structures: queues, stacks and multisets, and examine their relative computational power.
| שפה מקורית | אנגלית |
|---|---|
| כותר פרסום המארח | Structural Information and Communication Complexity - 22nd International Colloquium, SIROCCO 2015, Post-Proceedings |
| עורכים | Christian Scheideler |
| מוציא לאור | Springer Verlag |
| עמודים | 414-428 |
| מספר עמודים | 15 |
| מסת"ב (מודפס) | 9783319252575 |
| מזהי עצם דיגיטלי (DOIs) | |
| סטטוס פרסום | פורסם - 2015 |
| פורסם באופן חיצוני | כן |
| אירוע | 22nd International Colloquium on Structural Information and Communication Complexity, SIROCCO 2015 - Montserrat, ספרד משך הזמן: 14 יולי 2015 → 16 יולי 2015 |
סדרות פרסומים
| שם | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| כרך | 9439 |
| ISSN (מודפס) | 0302-9743 |
| ISSN (אלקטרוני) | 1611-3349 |
כנס
| כנס | 22nd International Colloquium on Structural Information and Communication Complexity, SIROCCO 2015 |
|---|---|
| מדינה/אזור | ספרד |
| עיר | Montserrat |
| תקופה | 14/07/15 → 16/07/15 |
הערה ביבליוגרפית
Publisher Copyright:© Springer International Publishing Switzerland 2015.