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 bounds on the gain of permitting dynamic allocation of communication channels in distributed computing
Responsible organisation
1999 (English)In: Acta Informatica, ISSN 0001-5903, E-ISSN 1432-0525, 425-446 p.Article in journal (Refereed) Published
Abstract [en]

Consider a distributed system consisting of n computers connected by a number of identical broadcast channels. All computers may receive messages from all channels. We distinguish between two kinds of systems: systems in which the computers may send on any channel (dynamic allocation) and system where the send port of each computer is statically allocated to a particular channel. A distributed task (application) is executed on the distributed system. A task performs execution as well as communication between its subtasks. We compare the completion time of the communication for such a task using dynamic allocation and k(d) channels with the completion time using static allocation and k(s) channels. Some distributed tasks will benefit very much from allowing dynamic allocation, whereas others will work fine with static allocation. In this paper we define optimal upper and lower bounds on the gain (or loss) of using dynamic allocation and k(d) channels compared to static allocation and k(s) channels. Our results show that, for some tasks, the gain of permitting dynamic allocation is substantial, e.g. when k(s) = k(d) = 3, there are tasks which will complete 1.89 times faster using dynamic allocation compared to using the best possible static allocation, but there are no tasks with a higher such ratio.

Place, publisher, year, edition, pages
NEW YORK: SPRINGER VERLAG , 1999. 425-446 p.
National Category
Computer Science
Identifiers
URN: urn:nbn:se:bth-8140ISI: 000083380500001Local ID: oai:bth.se:forskinfo027FE475585B95EEC12575B0002127BAOAI: oai:DiVA.org:bth-8140DiVA: diva2:835829
Available from: 2012-09-18 Created: 2009-05-08 Last updated: 2015-06-30Bibliographically approved

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Lundberg, LarsLennerstad, Håkan
In the same journal
Acta Informatica
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

Total: 18 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