3206 search results - page 112 / 642 » Optimizing Graph Algorithms for Improved Cache Performance |
110
Voted
JPDC
2006
15 years 2 months ago
2006
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
100
Voted
ICCD
2008
IEEE
15 years 11 months ago
2008
IEEE
— This paper evaluates various instruction- and data-cache organizations in terms of performance, power, energy and area on a suitably selected biomedical benchmark suite. The be...
94
Voted
DAC
2003
ACM
16 years 3 months ago
2003
ACM
Delay budget is an excess delay each component of a design can tolerate under a given timing constraint. Delay budgeting has been widely exploited to improve the design quality. W...
130
Voted
INFOCOM
2009
IEEE
15 years 9 months ago
2009
IEEE
—In hop-by-hop networks, provision of multipath routes for all nodes can improve fault tolerance and performance. In this paper we study the multipath route calculation by constr...
134
Voted
GECCO
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. Designing storage area networks is an NP-hard problem. Previous work has focused on traditional algorithmic techniques to automatically determine fabric requirements, net...