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
Thread-based mobility in Oz
KTH, School of Information and Communication Technology (ICT), Microelectronics and Information Technology, IMIT.
KTH, School of Information and Communication Technology (ICT), Microelectronics and Information Technology, IMIT.ORCID iD: 0000-0002-6283-7004
KTH, School of Information and Communication Technology (ICT), Microelectronics and Information Technology, IMIT.ORCID iD: 0000-0002-6718-0144
2005 (English)In: MULTIPARADIGM PROGRAMMING IN MOZART/OZ / [ed] Roy, PV, BERLIN: SPRINGER-VERLAG BERLIN , 2005, Vol. 3389, 137-148 p.Conference paper, Published paper (Refereed)
Abstract [en]

Strong mobility enables migration of entire computations combining code, data, and execution state (such as stack and program counter) between sites of computation. This is in contrast to weak mobility where migration is confined to just code and data. Strong mobility is essential for many applications where reconstruction of execution states is either difficult or even impossible: load balancing, reduction of network latency and traffic, and resource-related migration, just to name a few. This paper presents a model, programming abstractions, implementation, and evaluation of thread-based strong mobility. The model extends and takes advantage of a distributed programming model based on automatic synchronization through dataflow variables. It comes as a natural extension of dataflow computing which carefully separates issues concerning distribution and mobility. The programming abstractions capture various migration scenarios which differ in how the source and destination site relate to the site initiating migration. The implementation is based on replicating concurrent lightweight threads between sites controlled by migration managers.

Place, publisher, year, edition, pages
BERLIN: SPRINGER-VERLAG BERLIN , 2005. Vol. 3389, 137-148 p.
Series
LECTURE NOTES IN COMPUTER SCIENCE, ISSN 0302-9743 ; 3389
National Category
Computer Science
Identifiers
URN: urn:nbn:se:kth:diva-43211ISI: 000228723400012Scopus ID: 2-s2.0-24144466895ISBN: 3-540-25079-4 (print)OAI: oai:DiVA.org:kth-43211DiVA: diva2:447819
Conference
2nd International Conference Multiparadigm Programming in Mozart/Oz. Charleroi, BELGIUM. OCT 07-08, 2004
Note
QC 20111013Available from: 2011-10-13 Created: 2011-10-13 Last updated: 2011-10-13Bibliographically approved

Open Access in DiVA

No full text

Scopus

Authority records BETA

Schulte, ChristianHaridi, Seif

Search in DiVA

By author/editor
Havelka, DraganSchulte, ChristianHaridi, Seif
By organisation
Microelectronics and Information Technology, IMIT
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
Total: 28 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