Sciweavers

4797 search results - page 360 / 960
» The complexity of partition tasks
Sort
View
PODC
1995
ACM
15 years 10 months ago
A Framework for Protocol Composition in Horus
The Horus system supports a communication architecture ats protocols as instances of an abstract data type. This approach encourages developers to partition complex protocols into...
Robbert van Renesse, Kenneth P. Birman, Roy Friedm...
DATE
2010
IEEE
139views Hardware» more  DATE 2010»
15 years 10 months ago
Finding reset nondeterminism in RTL designs - scalable X-analysis methodology and case study
Due to increases in design complexity, routing a reset signal to all registers is becoming more difficult. One way to solve this problem is to reset only certain registers and rely...
Hong-Zu Chou, Haiqian Yu, Kai-Hui Chang, Dylan Dob...
ICALP
2010
Springer
15 years 8 months ago
Resource Oblivious Sorting on Multicores
We present a new deterministic sorting algorithm that interleaves the partitioning of a sample sort with merging. Sequentially, it sorts n elements in O(n log n) time cache-oblivi...
Richard Cole, Vijaya Ramachandran
196
Voted
CC
2008
Springer
144views System Software» more  CC 2008»
15 years 8 months ago
Control Flow Emulation on Tiled SIMD Architectures
Heterogeneous multi-core and streaming architectures such as the GPU, Cell, ClearSpeed, and Imagine processors have better power/ performance ratios and memory bandwidth than tradi...
Ghulam Lashari, Ondrej Lhoták, Michael McCo...
NETWORKING
2010
15 years 8 months ago
Synapse: A Scalable Protocol for Interconnecting Heterogeneous Overlay Networks
This paper presents Synapse, a scalable protocol for information retrieval over the inter-connection of heterogeneous overlay networks. Applications on top of Synapse see those int...
Luigi Liquori, Cédric Tedeschi, Laurent Van...