Sciweavers

1425 search results - page 20 / 285
» Beyond Dependency Graphs
Sort
View
AGTIVE
2007
Springer
14 years 2 months ago
Graph Rewriting for Hardware Dependent Program Optimizations
We present a compiler internal program optimization that uses graph rewriting. This optimization enables the compiler to automatically use rich instructions (such as SIMD instructi...
Andreas Schösser, Rubino Geiß
IEEEPACT
2002
IEEE
14 years 26 days ago
Exploiting Pseudo-Schedules to Guide Data Dependence Graph Partitioning
This paper presents a new modulo scheduling algorithm for clustered microarchitectures. The main feature of the proposed scheme is that the assignment of instructions to clusters ...
Alex Aletà, Josep M. Codina, F. Jesú...
ATAL
2005
Springer
14 years 1 months ago
A simulator for multi-agent partnership formation based on dependence graphs
The PartNET++ system is an experimental multi-agent-based simulation tool that uses a new model based on hyper-graphs for understanding partnership formation among heterogeneous a...
Júlio de Lima do Rêgo Monteiro, Jaime...
WWW
2008
ACM
14 years 8 months ago
IRLbot: scaling to 6 billion pages and beyond
This paper shares our experience in designing a web crawler that can download billions of pages using a single-server implementation and models its performance. We show that with ...
Hsin-Tsang Lee, Derek Leonard, Xiaoming Wang, Dmit...
CRYPTO
2007
Springer
134views Cryptology» more  CRYPTO 2007»
14 years 2 months ago
Domain Extension of Public Random Functions: Beyond the Birthday Barrier
A public random function is a random function that is accessible by all parties, including the adversary. For example, a (public) random oracle is a public random function {0, 1}â...
Ueli M. Maurer, Stefano Tessaro