Sciweavers

51 search results - page 5 / 11
» Scheduling and Binding Algorithms for High-Level Synthesis
Sort
View
ISLPED
2003
ACM
96views Hardware» more  ISLPED 2003»
15 years 2 months ago
Effective graph theoretic techniques for the generalized low power binding problem
This paper proposes two very fast graph theoretic heuristics for the low power binding problem given fixed number of resources and multiple architectures for the resources. First...
Azadeh Davoodi, Ankur Srivastava
ISLPED
1995
ACM
100views Hardware» more  ISLPED 1995»
15 years 1 months ago
Simultaneous scheduling and binding for power minimization during microarchitecture synthesis
ABSTRACT { Sub-micron technologies and the increasing size and complexity of integrated components have aggravated the e ect of long interconnects and buses, compared to that of ga...
Aurobindo Dasgupta, Ramesh Karri
65
Voted
ASPDAC
1995
ACM
77views Hardware» more  ASPDAC 1995»
15 years 1 months ago
A scheduling algorithm for synthesis of bus-partitioned architectures
- Due to efficient interconnect structure and internal parallelism bus-partitioned architectures are very beneficial for sub-micron chip design. This paper presents a new approach ...
Vasily G. Moshnyaga, Fumiaki Ohbayashi, Keikichi T...
ISSS
1995
IEEE
117views Hardware» more  ISSS 1995»
15 years 1 months ago
Scheduling and resource binding for low power
Decisions taken at the earliest steps of the design process may have a significantimpact on the characteristics of the final implementation. This paper illustrates how power con...
Enric Musoll, Jordi Cortadella
ICCD
2002
IEEE
152views Hardware» more  ICCD 2002»
15 years 6 months ago
Register Binding Based Power Management for High-level Synthesis of Control-Flow Intensive Behaviors
A circuit or circuit component that does not contain any spurious switching activity, i.e., activity that is not required by its specified functionality, is called perfectly power...
Lin Zhong, Jiong Luo, Yunsi Fei, Niraj K. Jha