Sciweavers

6740 search results - page 1152 / 1348
» Using Classification as a Programming Language
Sort
View
152
Voted
ICS
2005
Tsinghua U.
15 years 10 months ago
Lightweight reference affinity analysis
Previous studies have shown that array regrouping and structure splitting significantly improve data locality. The most effective technique relies on profiling every access to eve...
Xipeng Shen, Yaoqing Gao, Chen Ding, Roch Archamba...
ANCS
2007
ACM
15 years 9 months ago
Ruler: high-speed packet matching and rewriting on NPUs
Programming specialized network processors (NPU) is inherently difficult. Unlike mainstream processors where architectural features such as out-of-order execution and caches hide ...
Tomas Hruby, Kees van Reeuwijk, Herbert Bos
PASTE
2010
ACM
15 years 7 months ago
Null dereference analysis in practice
Many analysis techniques have been proposed to determine when a potentially null value may be dereferenced. But we have observed in practice that not every potential null derefere...
Nathaniel Ayewah, William Pugh
145
Voted
CORR
2010
Springer
116views Education» more  CORR 2010»
15 years 5 months ago
Dist-Orc: A Rewriting-based Distributed Implementation of Orc with Formal Analysis
Abstract. Orc is a theory of orchestration of services that allows structured programming of distributed and timed computations. Several formal semantics have been proposed for Orc...
Musab AlTurki, José Meseguer
IPPS
2010
IEEE
15 years 3 months ago
Speculative execution on multi-GPU systems
Abstract--The lag of parallel programming models and languages behind the advance of heterogeneous many-core processors has left a gap between the computational capability of moder...
Gregory F. Diamos, Sudhakar Yalamanchili
« Prev « First page 1152 / 1348 Last » Next »