ملخص
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 |
المعرِّفات الرقمية للأشياء | |
حالة النشر | نُشِر - 2015 |
منشور خارجيًا | نعم |
الحدث | 22nd International Colloquium on Structural Information and Communication Complexity, SIROCCO 2015 - Montserrat, أسبانيا المدة: ١٤ يوليو ٢٠١٥ → ١٦ يوليو ٢٠١٥ |
سلسلة المنشورات
الاسم | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
مستوى الصوت | 9439 |
رقم المعيار الدولي للدوريات (المطبوع) | 0302-9743 |
رقم المعيار الدولي للدوريات (الإلكتروني) | 1611-3349 |
!!Conference
!!Conference | 22nd International Colloquium on Structural Information and Communication Complexity, SIROCCO 2015 |
---|---|
الدولة/الإقليم | أسبانيا |
المدينة | Montserrat |
المدة | ١٤/٠٧/١٥ → ١٦/٠٧/١٥ |
ملاحظة ببليوغرافية
Publisher Copyright:© Springer International Publishing Switzerland 2015.