uu.seUppsala universitets publikationer
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Language Constructs for Safe Parallel Programming on Multi-Cores
Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för datalogi.
2016 (Engelska)Doktorsavhandling, sammanläggning (Övrigt vetenskapligt)
Abstract [en]

The last decade has seen the transition from single-core processors to multi-cores and many-cores. This move has by and large shifted the responsibility from chip manufacturers to programmers to keep up with ever-increasing expectations on performance. In the single-core era, improvements in hardware capacity could immediately be leveraged by an application: faster machine - faster program. In the age of the multi-cores, this is no longer the case. Programs must be written in specific ways to utilize available parallel hardware resources.

Programming language support for concurrent and parallel programming is poor in most popular object-oriented programming languages. Shared memory, threads and locks is the most common concurrency model provided. Threads and locks are hard to understand, error-prone and inflexible; they break encapsulation - the very foundation of the object-oriented approach. This makes it hard to break large complex problems into smaller pieces which can be solved independently and composed to make a whole. Ubiquitous parallelism and object-orientation, seemingly, do not match.

Actors, or active objects, have been proposed as a concurrency model better fit for object-oriented programming than threads and locks. Asynchronous message passing between actors each with a logical thread of control preserves encapsulation as objects themselves decide when messages are executed. Unfortunately most implementations of active objects do not prevent sharing of mutable objects across actors. Sharing, whether on purpose or by accident, exposes objects to multiple threads of control, destroying object encapsulation.

In this thesis we show techniques for compiler-enforced isolation of active objects, while allowing sharing and zero-copy communication of mutable data in the cases where it is safe to do so. We also show how the same techniques that enforce isolation can be utilized internal to an active object to allow data race-free parallel message processing and data race-free structured parallel computations. This overcomes the coarse-grained nature of active object parallelism without compromising safety.

Ort, förlag, år, upplaga, sidor
Uppsala: Acta Universitatis Upsaliensis, 2016. , 105 s.
Serie
Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology, ISSN 1651-6214 ; 1319
Nyckelord [en]
Programming Languages, Type Systems, Ownership Types, Concurrency, Parallelism, Actors, Active Objects, Structured Parallelism, Data Race-Freedom, Immutability, Uniqueness
Nationell ämneskategori
Datavetenskap (datalogi)
Forskningsämne
Datavetenskap
Identifikatorer
URN: urn:nbn:se:uu:diva-266795ISBN: 978-91-554-9413-1 (tryckt)OAI: oai:DiVA.org:uu-266795DiVA: diva2:872118
Disputation
2016-01-18, 2446, ITC, Lägerhyddsvägen 2, hus 2, Uppsala, 13:00 (Engelska)
Opponent
Handledare
Projekt
UPMARC
Tillgänglig från: 2015-12-17 Skapad: 2015-11-10 Senast uppdaterad: 2016-04-18Bibliografiskt granskad
Delarbeten
1. Ownership, Uniqueness, and Immutability
Öppna denna publikation i ny flik eller fönster >>Ownership, Uniqueness, and Immutability
2008 (Engelska)Ingår i: Lecture Notes in Business Information Processing, ISSN 1865-1348, E-ISSN 1865-1356Artikel i tidskrift (Refereegranskat) Published
Abstract [en]

Programming in an object-oriented language demands a fine balance between flexibility and control. At one level, objects need to interact freely to achieve our implementation goals. At a higher level, architectural constraints that ensure the system can be understood by new developers and can evolve as requirements change must be met. To resolve this tension, researchers have developed type systems expressing ownership and behavioural restrictions such as immutability. This work reports on our consolidation of the resulting discoveries into a single programming language. Our language, Joe 3 , imposes little additional syntactic overhead, yet can encode powerful patterns such as fractional permissions and the reference modes of Flexible Alias Protection.

Nationell ämneskategori
Datavetenskap (datalogi)
Identifikatorer
urn:nbn:se:uu:diva-266671 (URN)10.1007/978-3-540-69824-1_11 (DOI)
Konferens
46th International Conference, TOOLS EUROPE 2008, Zurich, Switzerland, June 30 - July 4, 2008.
Tillgänglig från: 2015-11-10 Skapad: 2015-11-10 Senast uppdaterad: 2017-12-01
2. Minimal Ownership for Active Objects
Öppna denna publikation i ny flik eller fönster >>Minimal Ownership for Active Objects
2008 (Engelska)Ingår i: Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349Artikel i tidskrift (Refereegranskat) Published
Abstract [en]

Active objects offer a structured approach to concurrency, encapsulating both unshared state and a thread of control. For efficient data transfer, data should be passed by reference whenever possible, but this introduces aliasing and undermines the validity of the active objects. This paper proposes a minimal variant of ownership types that preserves the required race freedom invariant yet enables data transfer by reference between active objects (that is, without copying) in many cases, and a cheap clone operation where copying is necessary. Our approach is general and should be adaptable to several existing active object systems.

Nationell ämneskategori
Datavetenskap (datalogi)
Identifikatorer
urn:nbn:se:uu:diva-266793 (URN)10.1007/978-3-540-89330-1_11 (DOI)
Konferens
6th Asian Symposium, APLAS 2008, Bangalore, India, December 9-11, 2008
Projekt
EU project IST-33826 CREDO
Tillgänglig från: 2015-11-10 Skapad: 2015-11-10 Senast uppdaterad: 2017-12-01
3. Welterweight Java
Öppna denna publikation i ny flik eller fönster >>Welterweight Java
2010 (Engelska)Ingår i: Objects, Models, Components, Patterns / [ed] Vitek, Jan, Berlin: Springer-Verlag , 2010, 97-116 s.Konferensbidrag, Publicerat paper (Refereegranskat)
Ort, förlag, år, upplaga, sidor
Berlin: Springer-Verlag, 2010
Serie
Lecture Notes in Computer Science, ISSN 0302-9743 ; 6141
Nationell ämneskategori
Datavetenskap (datalogi)
Identifikatorer
urn:nbn:se:uu:diva-130897 (URN)10.1007/978-3-642-13953-6_6 (DOI)000286162000006 ()978-3-642-13952-9 (ISBN)
Konferens
48th International Conference, TOOLS 2010
Projekt
UPMARCFacilitating Concurrent and Parallel Programming in Mainstream Programming Languages
Tillgänglig från: 2010-09-17 Skapad: 2010-09-17 Senast uppdaterad: 2016-01-13Bibliografiskt granskad
4. Multiple Aggregate Entry Points for Ownership Types
Öppna denna publikation i ny flik eller fönster >>Multiple Aggregate Entry Points for Ownership Types
2012 (Engelska)Ingår i: ECOOP 2012 – Object-Oriented Programming, Springer Berlin/Heidelberg, 2012, 156-180 s.Konferensbidrag, Publicerat paper (Refereegranskat)
Ort, förlag, år, upplaga, sidor
Springer Berlin/Heidelberg, 2012
Serie
Lecture Notes in Computer Science, ISSN 0302-9743 ; 7313
Nationell ämneskategori
Datavetenskap (datalogi)
Identifikatorer
urn:nbn:se:uu:diva-176660 (URN)10.1007/978-3-642-31057-7_8 (DOI)978-3-642-31056-0 (ISBN)
Konferens
26th European Conference on Object-Oriented Programming
Projekt
UPMARCFacilitating Concurrent and Parallel Programming in Mainstream Programming Languages
Tillgänglig från: 2012-06-28 Skapad: 2012-06-21 Senast uppdaterad: 2016-01-13Bibliografiskt granskad
5. Refined Ownership: Fine-grained controlled internal sharing
Öppna denna publikation i ny flik eller fönster >>Refined Ownership: Fine-grained controlled internal sharing
2015 (Engelska)Ingår i: Formal Methods for Multicore Programming, 2015, Vol. 9104, 179-210 s.Konferensbidrag, Publicerat paper (Refereegranskat)
Abstract [en]

Ownership type systems give a strong notion of separation between aggregates. Objects belonging to different owners cannot be aliased, and thus a mutating operation internal to one object is guaranteed to be invisible to another. This naturally facilitates reasoning about correctness on a local scale, but also proves beneficial for coarse-grained parallelism as noninterference between statements touching different objects is easily established. For fine-grained parallelism, ownership types fall short as owner-based disjointness only allows separation of the innards of different aggregates, which is very coarse-grained. Concretely: ownership types can reason about the disjointness of two different data structures, but cannot reason about the internal structure or disjointness within the data structure, without resorting to static and overly constraining measures. For similar reasons, ownership fails to determine internal disjointness of external pointers to objects that share a common owner. In this paper, we introduce the novel notion of refined ownership which overcomes these limitations by allowing precise local reasoning about a group of objects even though they belong to the same external owner. Using refined ownership, we can statically check determinism of parallel operations on tree-shaped substructures of a data structure, including operations on values external to the structure, without imposing any non-local alias restrictions.

Serie
Lecture Notes in Computer Science, ISSN 0302-9743 ; 9104
Nationell ämneskategori
Datavetenskap (datalogi)
Identifikatorer
urn:nbn:se:uu:diva-266673 (URN)10.1007/978-3-319-18941-3_5 (DOI)000362511600005 ()978-3-319-18941-3 (ISBN)978-3-319-18940-6 (ISBN)
Konferens
15th International School on Formal Methods for the Design of Computer, Communication, and Software Systems; SFM 2015, June 15–19, Bertinoro, Italy
Projekt
UPMARCUPSCALE
Tillgänglig från: 2015-05-07 Skapad: 2015-11-10 Senast uppdaterad: 2016-01-13Bibliografiskt granskad

Open Access i DiVA

fulltext(1836 kB)205 nedladdningar
Filinformation
Filnamn FULLTEXT01.pdfFilstorlek 1836 kBChecksumma SHA-512
66e0fa128999241c05d63480a74b9788b5c9003680417c0e6d16a72574cbf51840d56fa34257f75206dbc90f5da4e175bd951046f1e0c67ad074485a1b26d10f
Typ fulltextMimetyp application/pdf
Köp publikationen >>

Personposter BETA

Östlund, Johan

Sök vidare i DiVA

Av författaren/redaktören
Östlund, Johan
Av organisationen
DatalogiAvdelningen för datalogi
Datavetenskap (datalogi)

Sök vidare utanför DiVA

GoogleGoogle Scholar
Totalt: 205 nedladdningar
Antalet nedladdningar är summan av nedladdningar för alla fulltexter. Det kan inkludera t.ex tidigare versioner som nu inte längre är tillgängliga.

isbn
urn-nbn

Altmetricpoäng

isbn
urn-nbn
Totalt: 2754 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf