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
Generic distribution support for programming systems
KTH, School of Information and Communication Technology (ICT), Microelectronics and Information Technology, IMIT.
2005 (English)Doctoral thesis, comprehensive summary (Other scientific)
Abstract [en]

This dissertation provides constructive proof, through the implementation of a middleware, that distribution transparency is practical, generic, and extensible. Fault tolerant distributed services can be developed by using the failure detection abilities of the middleware. By generic we mean that the middleware can be used for many different programming languages and paradigms. Distribution for each kind of language entity is done in terms of consistency protocols, which guarantee that the semantics of the entities are preserved in a distributed setting. The middleware allows new consistency protocols to be added easily. The efficiency of the middleware and the ease of integration are shown by coupling the middleware to a programming system, which encompasses the object oriented, the functional, and the concurrent-declarative programming paradigms. Our measurements show that the distribution middleware is competitive with the most popular distributed programming systems (JavaRMI, .NET, IBM CORBA).

Place, publisher, year, edition, pages
Stockholm: KTH , 2005. , ix, 133 p.
Series
Trita-IT. AVH, 2005:03
Series
SICS Dissertation Series 39, ISSN 1101-1335
Keyword [en]
Datavetenskap, computer sicence
Keyword [sv]
Datavetenskap
National Category
Computer Science
Identifiers
URN: urn:nbn:se:kth:diva-261OAI: oai:DiVA.org:kth-261DiVA: diva2:8255
Public defence
2005-06-09, Sal D, KTH Forum, 10:00
Opponent
Supervisors
Note
QC 20101029Available from: 2005-06-07 Created: 2005-06-07 Last updated: 2010-10-29Bibliographically approved
List of papers
1. The DSS, a Middleware Library for Efficent an Transparent Distribution of Language Entities.
Open this publication in new window or tab >>The DSS, a Middleware Library for Efficent an Transparent Distribution of Language Entities.
2004 (English)In: Proceedings of HICSS'37, Hawaii, USA, 2004Conference paper, Published paper (Other academic)
Abstract [en]

This paper describes a novel language independentmodel for distribution of language entities, which allowsfor fine-grained instrumentation of entity consistencyprotocols on a per-entity basis. The model is implementedas a middleware component, designed to enhancearbitrary high-level programming languages withdistribution support on the language entity level. Themiddleware library is extendable using internal interfacesto add new protocols over three different aspectsof distribution.

National Category
Computer Science
Identifiers
urn:nbn:se:kth:diva-25723 (URN)
Note
QC 20101029Available from: 2010-10-29 Created: 2010-10-29 Last updated: 2010-10-29Bibliographically approved
2. The design and evaluation of a middleware library for distribution of language entities
Open this publication in new window or tab >>The design and evaluation of a middleware library for distribution of language entities
2003 (English)In: ADVANCES IN COMPUTING SCIENCE - ASIAN 2003 - PROGRAMMING LANGUAGES AND DISTRIBUTED COMPUTATION, 2003, Vol. 2896, 243-259 p.Conference paper, Published paper (Refereed)
Abstract [en]

The paper presents a modular design of a distribution middleware that supports the wide variety of entities that exist in high level languages. Such entities are classified into mutables, immutables and transients. The design is factorized in order to allow multiple consistency protocols for the same entity type, and multiple coordination strategies for implementing the protocols that differ in their failure behavior. The design is implemented and evaluated. It shows a very competitive performance.

Series
LECTURE NOTES IN COMPUTER SCIENCE, ISSN 0302-9743
National Category
Computer Science
Identifiers
urn:nbn:se:kth:diva-25726 (URN)000187787000016 ()3-540-20632-9 (ISBN)
Conference
8th Asian Computing Science Conference MUMBAI, INDIA, DEC 10-12, 2003
Note
QC 20101029Available from: 2010-10-29 Created: 2010-10-29 Last updated: 2010-10-29Bibliographically approved
3. A peer-to-peer approach to enhance middleware connectivity
Open this publication in new window or tab >>A peer-to-peer approach to enhance middleware connectivity
Show others...
2004 (English)In: LECT NOTE COMPUT SCI, 2004, Vol. 3144, 71-82 p.Conference paper, Published paper (Refereed)
Abstract [en]

One of the problems of middleware for shared state is that they are designed, explicitly or implicitly, for symmetric networks. However, since the Internet is not symmetric, end-to-end process connectivity cannot be guaranteed. Our solution to this is to provide the middleware with a network abstraction layer that masks the asymmetry of the network and provides the illusion of a symmetric network. We describe the communication service of our middleware, the Distribution Subsystem (DSS), which carefully separates connections to remote processes from the protocols that communicate over them. This separation is used to plug-in a peer-to-peer module to provide symmetric and persistent connectivity. The P2P module can provide both up-to-date addresses for mobile processes as well as route discovery to overcome asymmetric links.

Series
Lecture notes in computer science, ISSN 0302-9743
National Category
Computer Science
Identifiers
urn:nbn:se:kth:diva-25727 (URN)10.1007/978-3-540-27860-3_9 (DOI)000223641400009 ()2-s2.0-35048845640 (Scopus ID)
Conference
7th International Conference on Principles of Distributed Systems (OPODIS 2003) MARTINIQUE, DEC 10-13, 2003
Note
QC 20101029Available from: 2010-10-29 Created: 2010-10-29 Last updated: 2010-10-29Bibliographically approved
4. Making the Distribution Subsystem Secure
Open this publication in new window or tab >>Making the Distribution Subsystem Secure
2004 (English)Report (Other academic)
Abstract [en]

This report presents how the Distribution Subsystem is made secure. A set of different security threats to a shared data programming system are identifed. The report presents the extensions nessesary to the DSS in order to cope with the identified security threats by maintaining reference security. A reference to a shared data structure cannot be forged or guessed; only by proper delegation can a thread acquire access to data originating at remote processes. Referential security is a requirement for secure distributed applications. By programmatically restricting access to distributed data to trusted nodes, a distributed application can be made secure. However, for this to be true, referential security must be supported on the level of the implementation.

Publisher
22 p.
Series
SICS Technical Report, ISSN 1100-3154 ; 2004:14
National Category
Computer Science
Identifiers
urn:nbn:se:kth:diva-25728 (URN)SICS-T–2004/14-SE (ISRN)
Note
QC 20101029Available from: 2010-10-29 Created: 2010-10-29 Last updated: 2010-10-29Bibliographically approved
5. Home Migration Using a Structured Peer-To-PeerOverlay Network
Open this publication in new window or tab >>Home Migration Using a Structured Peer-To-PeerOverlay Network
(English)Manuscript (preprint) (Other academic)
Abstract [en]

This paper presents the design and implementation of a decentralized home-migration protocol for the Distribution SubSystem(DSS) middleware. The DSS provides generic distribution support for shared data structures in open distributed systems. Previous approaches for migrating homes, such as forward pointers, broadcasts, and centralized directory services are known to have disadvantages. We propose using a structured P2P system to store the location of migrated homes. This enables seamless migration of homes, without the need for lengthy forward pointer chains that degrade performance and robustness. Nor is a dedicated data-base that requires administrative effort needed. The presented design depicts how the self-organizing aspects of peer-to-peer computing can be used to construct a fault-tolerant, scalable, efficient, distributed home-location service to enhance middleware functionality.

National Category
Computer Science
Identifiers
urn:nbn:se:kth:diva-25734 (URN)
Note
QC 20101029Available from: 2010-10-29 Created: 2010-10-29 Last updated: 2010-10-29Bibliographically approved
6. Fractional Weighted Reference Counting
Open this publication in new window or tab >>Fractional Weighted Reference Counting
2001 (English)In: Euro-Par 2001 / [ed] R. Sakellariou et al., Berlin: Springer Verlag , 2001, 486-490 p.Conference paper, Published paper (Refereed)
Abstract [en]

We introduce a scheme for distributed garbage collectionthat is an extension of Weighted Reference Counting. This scheme represents weights as fractions. It solves the problem of limited weight, preservesthe property of third-party independence, and does not induce extra messages for reference merging.

Place, publisher, year, edition, pages
Berlin: Springer Verlag, 2001
Series
Lecture Notes in Computer Science
National Category
Computer Science
Identifiers
urn:nbn:se:kth:diva-25736 (URN)10.1007/3-540-44681-8_71 (DOI)
Note
QC 20101029Available from: 2010-10-29 Created: 2010-10-29 Last updated: 2010-10-29Bibliographically approved
7. Internal Design of the Distribution Subsystem(DSS)
Open this publication in new window or tab >>Internal Design of the Distribution Subsystem(DSS)
2004 (English)Report (Other academic)
Abstract [en]

This technical report describes the implementation of the DSS middleware with focus on the design of the abstract entity interface and the coordination layer. Key concepts are highlighted and described, on the level of C++ classes.

Publisher
28 p.
Series
SICS Technical Report, ISSN 1110-3154 ; 2004:15
National Category
Computer Science
Identifiers
urn:nbn:se:kth:diva-25738 (URN)SICS-T–2004/15-SE (ISRN)
Note
QC 20101029Available from: 2010-10-29 Created: 2010-10-29 Last updated: 2010-10-29Bibliographically approved
8. Creating a Distributed Programming System Using the DSS:A Case Study of OzDSS.
Open this publication in new window or tab >>Creating a Distributed Programming System Using the DSS:A Case Study of OzDSS.
2004 (English)Report (Other academic)
Abstract [en]

This technical report describes the integration of the Distribution Subsystem (DSS) to the programming system Mozart. The result, OzDSS, is described in detail. Essential when coupling a programming system to the DSS is how the internal model of threads and language entities are mapped to the abstract entities of the DSS. The model of threads and language entities of Mozart is described at a detailed level to explain the design choices made when developing the code that couples the DSS to Mozart. To show the challenges associated with different thread implementations, the C++DSS system is introduced. C++DSS is a C++ library which uses the DSS to implement different types of distributed language entities in the form of C++ classes. Mozart emulates threads, thus there is no risk of multiple threads accessing the DSS simultaneously. C++DSS, on the other hand, makes use of POSIX threads, thus simultaneous access to the DSS from multiple POSIX threads can happen. The fundamental differences in how threads are treated in a system that emulates threads (Mozart) to a system that make use of native-threads~(C++DSS) is discussed. The paper is concluded by a performance comparison between the OzDSS system and other distributed programming systems. We see that the OzDSS system outperforms ``industry grade'' Java-RMI and Java-CORBA implementations.

Publisher
26 p.
Series
SICS Technical Report, ISSN 1100-3154 ; 2004:16
National Category
Computer Science
Identifiers
urn:nbn:se:kth:diva-25740 (URN)SICS-T–2004/16-SE (ISRN)
Note
QC 20101029Available from: 2010-10-29 Created: 2010-10-29 Last updated: 2010-10-29Bibliographically approved

Open Access in DiVA

fulltext(10407 kB)356 downloads
File information
File name FULLTEXT01.pdfFile size 10407 kBChecksum MD5
c31ccce97c72a7c8230fa787e33fc114c60448b3ca2cd79092699e004a046c48cd2e6faa
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Klintskog, Erik
By organisation
Microelectronics and Information Technology, IMIT
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 356 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

urn-nbn

Altmetric score

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