Sciweavers

975 search results - page 114 / 195
» Locality Optimization for Program Instances
Sort
View
ASPDAC
2000
ACM
159views Hardware» more  ASPDAC 2000»
15 years 10 months ago
Analytical minimization of half-perimeter wirelength
Global placement of hypergraphs is critical in the top-down placement of large timing-driven designs 10, 16 . Placement quality is evaluated in terms of the half-perimeter wirelen...
Andrew A. Kennings, Igor L. Markov
PPOPP
2003
ACM
15 years 11 months ago
Optimizing data aggregation for cluster-based internet services
Large-scale cluster-based Internet services often host partitioned datasets to provide incremental scalability. The aggregation of results produced from multiple partitions is a f...
Lingkun Chu, Hong Tang, Tao Yang, Kai Shen
SPAA
2003
ACM
15 years 11 months ago
Throughput-centric routing algorithm design
The increasing application space of interconnection networks now encompasses several applications, such as packet routing and I/O interconnect, where the throughput of a routing a...
Brian Towles, William J. Dally, Stephen P. Boyd
IPPS
2007
IEEE
16 years 14 days ago
Scalable, Distributed, Dynamic Resource Management for the ARMS Distributed Real-Time Embedded System
We present a scalable, hierarchical control system for the dynamic resource management of a distributed real-time embedded (DRE) system. This DRE is inspired by the DARPA Adaptive...
Kurt Rohloff, Yarom Gabay, Jianming Ye, Richard E....
ESOP
2004
Springer
15 years 11 months ago
Canonical Graph Shapes
Abstract. Graphs are an intuitive model for states of a (software) system that include pointer structures — for instance, object-oriented programs. However, a naive encoding resu...
Arend Rensink