Sciweavers

356 search results - page 32 / 72
» Parallelizing time with polynomial circuits
Sort
View
COR
2006
96views more  COR 2006»
13 years 9 months ago
Scheduling two parallel machines with a single server: the general case
This paper considers the problem of scheduling two-operation non-preemptable jobs on two identical semiautomatic machines. A single server is available to carry out the first (or ...
Amir H. Abdekhodaee, Andrew Wirth, Heng-Soon Gan
EUC
2005
Springer
14 years 2 months ago
Evaluation of Space Allocation Circuits
This paper describes the design and evaluation of the PCA (Plastic Cell Architecture) cell, which implements a novel space allocation method. PCA is a dynamically reconfigurable a...
Shinya Kyusaka, Hayato Higuchi, Taichi Nagamoto, Y...
ASPDAC
2005
ACM
96views Hardware» more  ASPDAC 2005»
13 years 11 months ago
Comprehensive frequency dependent interconnect extraction and evaluation methodology
Abstract— Frequency dependent interconnect analysis is challenging since lumped equivalent circuit models extracted at different frequencies exhibit distinct time and frequency d...
Rong Jiang, Charlie Chung-Ping Chen
ANCS
2006
ACM
14 years 3 months ago
A practical fast parallel routing architecture for Clos networks
Clos networks are an important class of switching networks due to their modular structure and much lower cost compared with crossbars. For routing I/O permutations of Clos network...
Si-Qing Zheng, Ashwin Gumaste, Enyue Lu
IPPS
2005
IEEE
14 years 2 months ago
Self-Stabilizing Anonymous Leader Election in a Tree
We propose a new self-stabilizing anonymous leader election algorithm in a tree graph. We show the correctness of the protocol and show that the protocol terminates in O(n4 ) time...
Zhenyu Xu, Pradip K. Srimani