text
stringlengths
0
50
parallel B-KEY
supercomputers I-KEY
or O
clusters B-KEY
of I-KEY
workstations I-KEY
is O
critical O
to O
high O
performance O
because O
reductions B-KEY
are O
common O
in O
scientific O
codes O
and O
a O
potential O
source O
of O
bottlenecks O
. O
Yet O
in O
many O
high-level O
languages O
, O
a O
mechanism O
for O
writing O
efficient O
reductions B-KEY
remains O
surprisingly O
absent O
. O
Further O
, O
when O
such O
mechanisms O
do O
exist O
, O
they O
often O
do O
not O
provide O
the O
flexibility O
a O
programmer O
needs O
to O
achieve O
a O
desirable O
level O
of O
performance O
. O
In O
this O
paper O
, O
we O
present O
a O
new O
language B-KEY
construct I-KEY
for O
arbitrary O
reductions B-KEY
that O
lets O
a O
programmer O
achieve O
a O
level O
of O
performance O
equal O
to O
that O
achievable O
with O
the O
highly O
flexible O
, O
but O
low-level O