Sciweavers

1205 search results - page 222 / 241
» On P Systems with Bounded Parallelism
Sort
View
PODC
2010
ACM
15 years 3 months ago
The multiplicative power of consensus numbers
: The Borowsky-Gafni (BG) simulation algorithm is a powerful reduction algorithm that shows that t-resilience of decision tasks can be fully characterized in terms of wait-freedom....
Damien Imbs, Michel Raynal
ICML
1997
IEEE
16 years 16 days ago
Predicting Multiprocessor Memory Access Patterns with Learning Models
Machine learning techniques are applicable to computer system optimization. We show that shared memory multiprocessors can successfully utilize machine learning algorithms for mem...
M. F. Sakr, Steven P. Levitan, Donald M. Chiarulli...
STOC
2009
ACM
91views Algorithms» more  STOC 2009»
16 years 10 days ago
Inaccessible entropy
We put forth a new computational notion of entropy, which measures the (in)feasibility of sampling high entropy strings that are consistent with a given protocol. Specifically, we...
Iftach Haitner, Omer Reingold, Salil P. Vadhan, Ho...
HPCA
2005
IEEE
16 years 2 days ago
Software Directed Issue Queue Power Reduction
The issue logic of a superscalar processor dissipates a large amount of static and dynamic power. Furthermore, its power density makes it a hot-spot requiring expensive cooling sy...
Antonio González, Jaume Abella, Michael F. ...
ICS
2009
Tsinghua U.
15 years 6 months ago
Parametric multi-level tiling of imperfectly nested loops
Tiling is a crucial loop transformation for generating high performance code on modern architectures. Efficient generation of multilevel tiled code is essential for maximizing da...
Albert Hartono, Muthu Manikandan Baskaran, C&eacut...