Sciweavers

1425 search results - page 236 / 285
» Beyond Dependency Graphs
Sort
View
146
Voted
WDAG
2007
Springer
125views Algorithms» more  WDAG 2007»
15 years 10 months ago
Approximating Wardrop Equilibria with Finitely Many Agents
We study adaptive routing algorithms in a round-based model. Suppose we are given a network equipped with load-dependent latency functions on the edges and a set of commodities eac...
Simon Fischer, Lars Olbrich, Berthold Vöcking
INFOCOM
2006
IEEE
15 years 10 months ago
To Peer or Not to Peer: Modeling the Evolution of the Internet's AS-Level Topology
— Internet connectivity at the AS level, defined in terms of pairwise logical peering relationships, is constantly evolving. This evolution is largely a response to economic, po...
Hyunseok Chang, Sugih Jamin, Walter Willinger
IWPC
2006
IEEE
15 years 10 months ago
An Architecture to Support Model Driven Software Visualization
Program comprehension tools are a valuable resource for navigating and understanding large software systems. Package explorers, fan-in / fan-out views, dependency graphs and cover...
R. Ian Bull, Margaret-Anne D. Storey, Jean-Marie F...
PRDC
2006
IEEE
15 years 10 months ago
Fault-Tolerant Partitioning Scheduling Algorithms in Real-Time Multiprocessor Systems
This paper presents the performance analysis of several well-known partitioning scheduling algorithms in real-time and fault-tolerant multiprocessor systems. Both static and dynam...
Hakem Beitollahi, Geert Deconinck
ASPDAC
2006
ACM
119views Hardware» more  ASPDAC 2006»
15 years 10 months ago
Using speculative computation and parallelizing techniques to improve scheduling of control based designs
Recent research results have seen the application of parallelizing techniques to high-level synthesis. In particular, the effect of speculative code transformations on mixed contr...
Roberto Cordone, Fabrizio Ferrandi, Marco D. Santa...