Sciweavers

80 search results - page 14 / 16
» Throughput Constraint for Synchronous Data Flow Graphs
Sort
View
TCC
2009
Springer
132views Cryptology» more  TCC 2009»
14 years 8 months ago
Authenticated Adversarial Routing
: The aim of this paper is to demonstrate the feasibility of authenticated throughput-ecient routing in an unreliable and dynamically changing synchronous network in which the majo...
Yair Amir, Paul Bunn, Rafail Ostrovsky
DATE
2005
IEEE
171views Hardware» more  DATE 2005»
14 years 1 months ago
Access Pattern-Based Code Compression for Memory-Constrained Embedded Systems
As compared to a large spectrum of performance optimizations, relatively little effort has been dedicated to optimize other aspects of embedded applications such as memory space r...
Ozcan Ozturk, Hendra Saputra, Mahmut T. Kandemir, ...
SOSP
2009
ACM
14 years 4 months ago
Quincy: fair scheduling for distributed computing clusters
This paper addresses the problem of scheduling concurrent jobs on clusters where application data is stored on the computing nodes. This setting, in which scheduling computations ...
Michael Isard, Vijayan Prabhakaran, Jon Currey, Ud...
PPOPP
2005
ACM
14 years 1 months ago
Teleport messaging for distributed stream programs
In this paper, we develop a new language construct to address one of the pitfalls of parallel programming: precise handling of events across parallel components. The construct, te...
William Thies, Michal Karczmarek, Janis Sermulins,...
IISWC
2008
IEEE
14 years 2 months ago
Accelerating multi-core processor design space evaluation using automatic multi-threaded workload synthesis
The design and evaluation of microprocessor architectures is a difficult and time-consuming task. Although small, handcoded microbenchmarks can be used to accelerate performance e...
Clay Hughes, Tao Li