Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Multiprocess time queue
Luleå tekniska universitet.
2001 (engelsk)Inngår i: 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, s. 599-609Konferansepaper, Publicerat paper (Fagfellevurdert)
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.

sted, utgiver, år, opplag, sider
Berlin: Encyclopedia of Global Archaeology/Springer Verlag, 2001. s. 599-609
Serie
Lecture Notes in Computer Science, ISSN 0302-9743 ; 2223
HSV kategori
Forskningsprogram
Kommunikations- och beräkningssystem
Identifikatorer
URN: urn:nbn:se:ltu:diva-38256DOI: 10.1007/3-540-45678-3_51Scopus ID: 2-s2.0-71049137368Lokal ID: c98690e0-a0ac-11db-8975-000ea68e967bOAI: oai:DiVA.org:ltu-38256DiVA, id: diva2:1011755
Konferanse
International Symposium on Algorithms and Computation : 19/12/2001 - 21/12/2001
Merknad
Godkänd; 2001; 20060922 (ysko)Tilgjengelig fra: 2016-10-03 Laget: 2016-10-03 Sist oppdatert: 2018-07-10bibliografisk kontrollert

Open Access i DiVA

fulltekst(202 kB)48 nedlastinger
Filinformasjon
Fil FULLTEXT01.pdfFilstørrelse 202 kBChecksum SHA-512
d4d0e31ed5984f82735aaf2ee37a621958cbfe969568959ef85a2b32473fc4cca162aab537301322ea227872c3e35e2a6db9e7acac16b7b423694df1f01dc6ce
Type fulltextMimetype application/pdf

Andre lenker

Forlagets fulltekstScopus

Personposter BETA

Brodnik, Andrej

Søk i DiVA

Av forfatter/redaktør
Brodnik, Andrej

Søk utenfor DiVA

GoogleGoogle Scholar
Totalt: 48 nedlastinger
Antall nedlastinger er summen av alle nedlastinger av alle fulltekster. Det kan for eksempel være tidligere versjoner som er ikke lenger tilgjengelige

doi
urn-nbn

Altmetric

doi
urn-nbn
Totalt: 42 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf