Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • 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
Optimal Performance bounds in Parallel Computing
Responsible organisation
2004 (English)Licentiate thesis, comprehensive summary (Other academic)
Abstract [en]

This thesis focuses on theoretical aspects of scheduling algorithms for parallel programs in mulitprocessors and aspects of finding recovery schemes for fault tolerant distributed systems.

Place, publisher, year, edition, pages
Karlskrona: Blekinge Institute of Technology , 2004. , 84 p.
Series
Blekinge Institute of Technology Licentiate Dissertation Series, ISSN 1650-2140 ; 3
National Category
Computer Science
Identifiers
URN: urn:nbn:se:bth-00316Local ID: oai:bth.se:forskinfo4F1795722A52C370C12571450041FD02ISBN: 91-7295-035-8 (print)OAI: oai:DiVA.org:bth-00316DiVA: diva2:838055
Available from: 2012-09-18 Created: 2006-04-03 Last updated: 2015-06-30Bibliographically approved

Open Access in DiVA

No full text

Computer Science

Search outside of DiVA

GoogleGoogle Scholar

Total: 12 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • 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