Search: onr:"swepub:oai:DiVA.org:su-177173" >
Progress Report :
-
Åkerblom, BeatriceStockholms universitet,Institutionen för data- och systemvetenskap,Computer and Systems Science Stockholm University,Stockholm Univ, Comp & Syst Sci, Stockholm, Sweden.
(author)
Progress Report : Exploring API Design for Capabilities for Programming with Arrays
- Article/chapterEnglish2019
Publisher, publication year, extent ...
-
2019-07-19
-
New York, NY, USA :Association for Computing Machinery (ACM),2019
-
printrdacarrier
Numbers
-
LIBRIS-ID:oai:DiVA.org:su-177173
-
https://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-177173URI
-
https://doi.org/10.1145/3340670.3342427DOI
-
https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-257978URI
-
https://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-420276URI
Supplementary language notes
-
Language:English
-
Summary in:English
Part of subdatabase
Classification
-
Subject category:ref swepub-contenttype
-
Subject category:kon swepub-publicationtype
Notes
-
QC 20190917
-
In on-going work, we are exploring reference capabilities for arrays, with the intention of carrying over previous results on statically guaranteed data-race freedom to parallel array algorithms. Reference capabilities typically restrict incoming pointers to an object to one (uniqueness), or restrict operations via multiple pointer to a single object (e.g., to only read). Extending such a design to arrays involve operations such as logically partitioning an array so that even though there are multiple pointers to a single array, these pointers cannot access the same elements.In this paper, we report on the on-going work of a prototype implementation of array capabilities, focusing in particular on the "array capability API design", meaning the native operations on capabilities such as splitting and merging arrays. Using our prototype implementation, we translate several existing array algorithms into using array capabilities and qualitatively study the result. In addition to identifying the need for additional operations, we study what features are commonly exercised, what are the recurring patterns, and how reliance on direct element addressing using indexes can be reduced. We end by discussing a possible design for a more performant implementation once the API is fixed.
Subject headings and genre
Added entries (persons, corporate bodies, meetings, titles ...)
-
Castegren, Elias,Doktor,1987-KTH,Programvaruteknik och datorsystem, SCS,Royal Inst Technol, Sch EECS, Stockholm, Sweden.(Swepub:kth)u1olkl0n
(author)
-
Wrigstad, Tobias,1976-Uppsala universitet,Datalogi(Swepub:uu)writo649
(author)
-
Stockholms universitetInstitutionen för data- och systemvetenskap
(creator_code:org_t)
Related titles
-
In:ICOOOLPS '19New York, NY, USA : Association for Computing Machinery (ACM)9781450368629
-
In:ECOOP 2019New York, NY, USA : Association for Computing Machinery (ACM)
-
In:Proceedings Of The 12Th Workshop On Implementation, Compilation And Optimization Of Object-Oriented Languages, Programs And Systems (ICOOOLPS' 19)New York, NY, USA : Association for Computing Machinery (ACM)
Internet link
Find in a library
To the university's database