Sciweavers

1686 search results - page 154 / 338
» Programs as polygraphs: computability and complexity
Sort
View
159
Voted
SIGARCH
2008
107views more  SIGARCH 2008»
15 years 3 months ago
A lightweight streaming layer for multicore execution
As multicore architectures gain widespread use, it becomes increasingly important to be able to harness their additional processing power to achieve higher performance. However, e...
David Zhang, Qiuyuan J. Li, Rodric Rabbah, Saman A...
144
Voted
IJHPCA
2007
114views more  IJHPCA 2007»
15 years 3 months ago
An Approach To Data Distributions in Chapel
A key characteristic of today’s high performance computing systems is a physically distributed memory, which makes the efficient management of locality essential for taking adv...
R. E. Diaconescu, Hans P. Zima
111
Voted
APLAS
2009
ACM
15 years 10 months ago
Asymptotic Resource Usage Bounds
When describing the resource usage of a program, it is usual to talk in asymptotic terms, such as the well-known “big O” notation, whereby we focus on the behaviour of the prog...
Elvira Albert, Diego Alonso, Puri Arenas, Samir Ge...
154
Voted
CATA
2003
15 years 5 months ago
A Restaurant Finder using Belief-Desire-Intention Agent Model and Java Technology
It is becoming more important to design systems capable of performing high-level management and control tasks in interactive dynamic environments. At the same time, it is difficul...
Dongqing Lin, Thomas P. Wiggen, Chang-Hyun Jo
141
Voted
CAL
2006
15 years 3 months ago
A Case for Compressing Traces with BDDs
Instruction-level traces are widely used for program and hardware analysis. However, program traces for just a few seconds of execution are enormous, up to several terabytes in siz...
Graham D. Price, Manish Vachharajani