Fun and Interesting Thoughts (FIT) is a special event held at the 2010 Conference on Programming Language Design and Implementation (PLDI). FIT is a venue for thoughts that present fresh insights, unveil surprising ideas, identify hidden trends, or that are simple neat and fun for a PLDI audience.
Monday, May 24, 2010
A New Java Runtime for a Parallel World
by Christoph Reichenbach and Yannis Smaragdakis, University of Massachusetts, Amherst
In this work, we propose exploiting the emergent ubiquity of multicore systems by adding easy-to-use parallelisable queries to legacy languages.
However, the legacy heap model found in existing implementations of languages such as Java use is not conductive to easy parallelisation. Consider querying all elements of a linked list: this query must chase O(n) pointers to visit each list element, but pointer chasing is not parallelisable. We thus propose replacing the legacy heap model by a relational heap model. In such a model, we would store fields (or collections of fields) in tables or associative structures, facilitating fast fan-out for parallel queries.
To offset the cost of accessing fields from tables (rather than in the usual object-oriented way) we are exploring two options: lazy migration between two memory representations, and field caches, which provide fast-path access to commonly used fields.
Fun and Interesting Thoughts (FIT) is a special event held at the 2010 Conference on Programming Language Design and Implementation (PLDI). FIT is a venue for thoughts that present fresh insights, unveil surprising ideas, identify hidden trends, or that are simple neat and fun for a PLDI audience.
In this work, we propose exploiting the emergent ubiquity of multicore systems by adding easy-to-use parallelisable queries to legacy languages.
ReplyDeleteHowever, the legacy heap model found in existing implementations of languages such as Java use is not conductive to easy parallelisation. Consider querying all elements of a linked list: this query must chase O(n) pointers to visit each list element, but pointer chasing is not parallelisable. We thus propose replacing the legacy heap model by a relational heap model. In such a model, we would store fields (or collections of fields) in tables or associative structures, facilitating fast fan-out for parallel queries.
To offset the cost of accessing fields from tables (rather than in the usual object-oriented way) we are exploring two options: lazy migration between two memory representations, and field caches, which provide fast-path access to commonly used fields.
van eskort
ReplyDeleteantalya eskort
tekirdağ eskort
gaziemir eskort
yalova eskort
şirinevler eskort
düzce bayan
manisa bayan
izmit bayan
görükle bayan
trabzon masöz
ReplyDeletevan masöz
yalova masöz
antakya masöz
alanya masöz
sincan masöz
çaycuma masöz
maraş masöz
çanakkale masöz
aydın masöz
tül perde modelleri
ReplyDeletemobil onay
MOBİL ODEME BOZDURMA
nft nasıl alınır
ankara evden eve nakliyat
trafik sigortası
dedektör
KURMA WEB SİTESİ
aşk kitapları
Good content. You write beautiful things.
ReplyDeletesportsbet
hacklink
hacklink
mrbahis
korsan taksi
vbet
vbet
mrbahis
taksi
dijital kartvizit
ReplyDeletereferans kimliği nedir
binance referans kodu
referans kimliği nedir
bitcoin nasıl alınır
resimli magnet
UBFA27
hatay
ReplyDeletekars
mardin
samsun
urfa
QC57J7
hatay
ReplyDeleteığdır
ısparta
mersin
ağrı
ZUC
https://saglamproxy.com
ReplyDeletemetin2 proxy
proxy satın al
knight online proxy
mobil proxy satın al
3CMMN
arnavutköy
ReplyDeleteartvin
avcılar
aydın
bağcılar
ONO
https://saglamproxy.com
ReplyDeletemetin2 proxy
proxy satın al
knight online proxy
mobil proxy satın al
BPGNPA
https://izmitone.com
ReplyDeletekuşadası
sex hattı
QQ0YR