Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Multiprocess time queue
Luleå tekniska universitet.
2001 (English)In: Algorithms and Computation: 12th International Symposium, ISAAC 2001, Christchurch, New Zealand, December 19-21, 2001. / [ed] Peter Eades; Tadao Takaoka, Berlin: Encyclopedia of Global Archaeology/Springer Verlag, 2001, p. 599-609Conference paper, Published paper (Refereed)
Abstract [en]

We show how to implement a bounded time queue for two different processes. The time queue is a variant of a priority queue with elements from a discrete universe. The bounded time queue has elements from a discrete bounded universe. One process has time constraints and may only spend constant worst case time on each operation while the other process may spend more time. The time constrained process only has to be able to perform some of the time queue operations while the other process has to be able to perform all operations. We show how to do a deamortization of the deleteMin cost and to provide mutual exclusion for the parts of the data structure that both processes maintain.

Place, publisher, year, edition, pages
Berlin: Encyclopedia of Global Archaeology/Springer Verlag, 2001. p. 599-609
Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; 2223
National Category
Computer Sciences
Research subject
Dependable Communication and Computation Systems
Identifiers
URN: urn:nbn:se:ltu:diva-38256DOI: 10.1007/3-540-45678-3_51Local ID: c98690e0-a0ac-11db-8975-000ea68e967bOAI: oai:DiVA.org:ltu-38256DiVA: diva2:1011755
Conference
International Symposium on Algorithms and Computation : 19/12/2001 - 21/12/2001
Note
Godkänd; 2001; 20060922 (ysko)Available from: 2016-10-03 Created: 2016-10-03 Last updated: 2018-01-14Bibliographically approved

Open Access in DiVA

fulltext(202 kB)21 downloads
File information
File name FULLTEXT01.pdfFile size 202 kBChecksum SHA-512
d4d0e31ed5984f82735aaf2ee37a621958cbfe969568959ef85a2b32473fc4cca162aab537301322ea227872c3e35e2a6db9e7acac16b7b423694df1f01dc6ce
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Search in DiVA

By author/editor
Brodnik, Andrej
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar
Total: 21 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 16 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf