Sciweavers

1912 search results - page 168 / 383
» Optimizing interconnection policies
Sort
View
ICPP
1993
IEEE
15 years 8 months ago
Closed Form Solutions for Bus and Tree Networks of Processors Load Sharing A Divisible Job
Optimal load allocation for load sharing a divisible job over processors interconnected in either a bus or a tree network is considered. The processors are either equipped with fro...
Sameer M. Bataineh, Te-Yu Hsiung, Thomas G. Robert...
EAAI
2010
107views more  EAAI 2010»
14 years 10 months ago
Honey bee social foraging algorithms for resource allocation: Theory and application
A model of honey bee social foraging is introduced to create an algorithm that solves a class of optimal resource allocation problems. We prove that if several such algorithms (&q...
Nicanor Quijano, Kevin M. Passino
141
Voted
DAC
2003
ACM
16 years 4 months ago
Multilevel global placement with retiming
Multiple clock cycles are needed to cross the global interconnects for multi-gigahertz designs in nanometer technologies. For synchronous designs, this requires retiming and pipel...
Jason Cong, Xin Yuan
ISCAS
2007
IEEE
144views Hardware» more  ISCAS 2007»
15 years 10 months ago
Multiple-Width Bus Partitioning Approach to Datapath Synthesis
—A shared bus is a suitable structure for minimizing the interconnections costs in system synthesis. It has also been shown that the word-length of Functional Units has a great i...
Arash Ahmadi, Mark Zwolinski
ENTCS
2008
138views more  ENTCS 2008»
15 years 4 months ago
Compositionality of Statically Scheduled IP
Timing Closure in presence of long global wire interconnects is one of the main current issues in System-onChip design. One proposed solution to the Timing Closure problem is Late...
Julien Boucaron, Jean-Vivien Millo