[[abstract]]A reconfigurable bus system is a bus system whose configuration is dynamically changeable. In this paper, using configurational computation, we show that the problems of sorting and computing convex hulls can be solved in O(1) time on two-dimensional (n×m) ×(n×[n/m]) processor arrays with reconfigurable bus systems, where n is the problem size and m is any integer between 1 and n.[[fileno]]2030215010001[[department]]資訊工程學
[[abstract]]The transitive closure problem in O(1) time is solved by a new method that is far differ...
The proposed research explores the possibilities of applying some base algorithms for sorting to the...
AbstractIn this paper, a new approach, which is based on function decomposition, is proposed for der...
A bus system that can change dynamically to suit computational needs is referred to as reconfigurabl...
A bus system that can change dynamically to suit computational needs is referred to as reconfigurabl...
[[abstract]]The power of a computation model usually indicates how fast a problem can be solved unde...
Two counterexamples are presented for a convex hull algorithm running on a mesh connected array of p...
We consider space-bounded computations on a random-access machine (RAM) where the input is given on ...
[[abstract]]A processor array with a reconfigurable bus system (abbreviated to PARBS) is a computati...
[[abstract]]The reconfigurable mesh, a parallel system with bus autonomy, can support various interc...
Abstract Mesh connected computers have become attractive models of com-puting because of their varie...
The reconfigurable array with slotted optical buses (RASOB) has recently received a lot of attention...
Abstract—In this paper, we present efficient algorithms for sorting, selection, and packet routing o...
[[abstract]]In this paper, a new approach, which is based on function decomposition, is proposed for...
Abstract. We present a fast algorithm for sorting on a linear array with a re-configurable pipelined...
[[abstract]]The transitive closure problem in O(1) time is solved by a new method that is far differ...
The proposed research explores the possibilities of applying some base algorithms for sorting to the...
AbstractIn this paper, a new approach, which is based on function decomposition, is proposed for der...
A bus system that can change dynamically to suit computational needs is referred to as reconfigurabl...
A bus system that can change dynamically to suit computational needs is referred to as reconfigurabl...
[[abstract]]The power of a computation model usually indicates how fast a problem can be solved unde...
Two counterexamples are presented for a convex hull algorithm running on a mesh connected array of p...
We consider space-bounded computations on a random-access machine (RAM) where the input is given on ...
[[abstract]]A processor array with a reconfigurable bus system (abbreviated to PARBS) is a computati...
[[abstract]]The reconfigurable mesh, a parallel system with bus autonomy, can support various interc...
Abstract Mesh connected computers have become attractive models of com-puting because of their varie...
The reconfigurable array with slotted optical buses (RASOB) has recently received a lot of attention...
Abstract—In this paper, we present efficient algorithms for sorting, selection, and packet routing o...
[[abstract]]In this paper, a new approach, which is based on function decomposition, is proposed for...
Abstract. We present a fast algorithm for sorting on a linear array with a re-configurable pipelined...
[[abstract]]The transitive closure problem in O(1) time is solved by a new method that is far differ...
The proposed research explores the possibilities of applying some base algorithms for sorting to the...
AbstractIn this paper, a new approach, which is based on function decomposition, is proposed for der...