Sciweavers

1534 search results - page 85 / 307
» Stochastic Bounds on Execution Times of Parallel Computation...
Sort
View
ECRTS
2010
IEEE
13 years 9 months ago
The Demand Bound Function Interface of Distributed Sporadic Pipelines of Tasks Scheduled by EDF
—In distributed real-time embedded systems (DRE), it is common to model an application as a set of task chains. Each chain is activated cyclically and must complete before an end...
Nicola Serreli, Giuseppe Lipari, Enrico Bini
CCGRID
2008
IEEE
14 years 3 months ago
Scheduling Asymmetric Parallelism on a PlayStation3 Cluster
Understanding the potential and implications of asymmetric multi-core processors for cluster computing is necessary, as these processors are rapidly becoming mainstream components...
Filip Blagojevic, Matthew Curtis-Maury, Jae-Seung ...
ICS
1998
Tsinghua U.
14 years 1 months ago
Load Execution Latency Reduction
In order to achieve high performance, contemporary microprocessors must effectively process the four major instruction types: ALU, branch, load, and store instructions. This paper...
Bryan Black, Brian Mueller, Stephanie Postal, Ryan...
ECAL
2007
Springer
14 years 3 months ago
Turing Complete Catalytic Particle Computers
The Bare Bones language is a programming language with a minimal set of operations that exhibits universal computation. We present a conceptual framework, Chemical Bare Bones, to c...
Anthony M. L. Liekens, Chrisantha Thomas Fernando
ISMB
1994
13 years 10 months ago
Predicting Location and Structure Of beta-Sheet Regions Using Stochastic Tree Grammars
We describe and demonstrate the effectiveness of a method of predicting protein secondary structures, sheet regions in particular, using a class of stochastic tree grammars as rep...
Hiroshi Mamitsuka, Naoki Abe