• Journal of Electrical Engineering and information Science
• /
• v.3 no.3
• /
• pp.281-285
• /
• 1998

Consider the two-dimensional sorted-set convex hull problem: Given N points in a plane sorted by the x coordinates, compute the convex hull of the points. We propose an O(logNlog logN)-time algorithm that solves the sorted-set convex hull problem on an N\ulcorner\ulcorner${\times}$N\ulcorner\ulcorner reconfigurable mesh. The best known algorithm for the problem on an N\ulcorner\ulcorner${\times}$N\ulcorner\ulcorner reconfigurable mesh takes O(log\ulcornerN) time. Although there is a constant-time algorithm on an N${\times}$N reconfigurable mesh for general two-dimensional convex hull problem, the general convex hull problem requires Θ(N\ulcorner\ulcorner) time on an N\ulcorner\ulcorner${\times}$N\ulcorner\ulcorner reconfigurable mesh due to bandwidth constraints.

• Journal of Information Processing Systems
• /
• v.7 no.1
• /
• pp.85-92
• /
• 2011

This paper shows an effective partitioning of static global row/column buses for tightly coupled 2D mesh-connected small processor arrays ("mesh", for short). With additional O(n/m (n/m + log m)) time slowdown, it enables the mesh of size $m{\times}m$ with static row/column buses to simulate the mesh of the larger size $n{\times}n$ with reconfigurable row/column buses ($m{\leq}n$). This means that if a problem can be solved in O(T) time by the mesh of size $n{\times}n$ with reconfigurable buses, then the same problem can be solved in O(Tn/m (n/m + log m)) time on the mesh of a smaller size $m{\times}m$ without a reconfigurable function. This time-cost is optimal when the relation $n{\geq}m$ log m holds (e.g., m = $n^{1-\varepsilon}$ for $\varepsilon$ > 0).

• The KIPS Transactions:PartA
• /
• v.9A no.2
• /
• pp.225-230
• /
• 2002

The constrained off-line competitive deletion problem is a simple form of the set manipulation operations problem. It excludes the insertion operation from the off-line competitive deletion problem. An optimal sequential algorithm and a CREW PRAM algorithm which runs $O(log^2nloglogn)$ time using O(n/loglogn) processors were already presented in the literature. In this paper, we present a reconfigurable mesh algorithm for the constrained off-line competitive deletion problem. The proposed algorithm is executed in a constant time on an $n{\times}n$ reconfigurable mesh, and the result is $AT^2$ optimal.

• International Journal of Computer Science & Network Security
• /
• v.21 no.4
• /
• pp.1-8
• /
• 2021

The subject of navigation has drawn a large interest in the last few years. Navigation problem (or path planning) finds the path between two points, source location and destination location. In smart cities, solving navigation problem is essential to all residents and visitors of such cities to guide them to move easily between locations. Also, the navigation problem is very important in case of moving robots that move around the city or part of it to get some certain tasks done such as delivering packages, delivering food, etc. In either case, solution to the navigation is essential. The core to navigation systems is the navigation algorithms they employ. Navigation algorithms can be classified into navigation algorithms that depend on maps and navigation without the use of maps. The map contains all available routes and its directions. In this proposal, we consider the first class. In this paper, we are interested in getting path planning solutions very fast. In doing so, we employ a parallel platform, Reconfigurable mesh (R-Mesh), to compute the path from source location to destination location. R-Mesh is a parallel platform that has very fast solutions to many problems and can be deployed in moving vehicles and moving robots. This paper presents two algorithms for path planning. The first assumes maps with linear streets. The second considers maps with branching streets. In both algorithms, the quality of the path is evaluated in terms of the length of the path and the number of turns in the path.

• Proceedings of the IEEK Conference
• /
• 2002.07a
• /
• pp.58-61
• /
• 2002

In this paper, we present a new generalized k-Tree-based (CU/PE) allocation model to perform dynamic resource (CU/PE) allocation/deallocation decision for the reconfigurable MSIMD/MIMD multi-dimensional (k-D) mesh-connected architectures. Those reconfigurable multi-SIMD/MIMD systems allow dynamic modes of executing tasks, which are SIMD and MIMD. The MIMD task requires only the free sub-system; however the SIMD task needs not only the free sub-system but also the corresponding free CU. In our new k-Tree-based (CU/PE) allocation model, we introduce two best-fit heuristics for the CU allocation decision: 1) the CU depth first search (CU-DFS) in O(kN$_{f}$ ) time and 2) the CU adjacent search (CU-AS) in O(k2$^{k}$ ) time. By the simulation study, the system performance of these two CU allocation strategies was also investigated. Our simulation results showed that the CU-AS and CU-DFS strategies performed the same system performance when applied for the reconfigurable MSIMD/MIMD 2-D and 3-D mesh-connected architectures.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.11
• /
• pp.2946-2953
• /
• 1999

Finite automation is a mathematical model to represent a system with discrete inputs and outputs. Finite automata are a useful tool for solving problems such as text editor, lexical analyzer, and switching circuit. In this paper, given a deterministic finite automaton of an input string of length n and m states, we propose a constant time parallel algorithm that represents the transition states of finite automata and determines the acceptance of an input string on a reconfigurable mesh of size [nm/2]$\times$2m.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.1
• /
• pp.66-74
• /
• 1999

A linear quadtree representation as a way to store a quadtree is efficient to save space compared with other representations. It , therefore, has been widely studied to develop efficient algorithms to execute operations related with quadtrees. In this paper, we present algorithm to find neighbor blocks of binary images represented by linear quadtrees, using three-dimensional n${\times}$n${\times}$n processors on RMESH(Reconfigurable MESH). Pur algorithm have O(1) time complexity.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.12
• /
• pp.640-647
• /
• 2002

In this paper, we consider the problems related to the edge visibility on a reconfigurable mesh(in short, RMESH). The following basic problems related to the edge visibility are considered: First, determine if a given polygon is visible from a specific edge, Second, find all edges from which a given polygon is visible. Third, compute the visibility polygon from a specific edge of a given polygon. In this paper, we consider the following problem in order to solve these problems in constant time: given two edges e and f of a simple polygon p, compute the maximal interval of f which is visible from e. We present a constant time algorithm for the problem on an N-N RMESH, where N is the number of vertices of P. Applying the algorithm, we can solve the above three problems in a constant time on a reconfigurable mesh. Specially, we can solve the third problem in a constant time on an N-$N_2$ RMESH.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.8B
• /
• pp.812-821
• /
• 2009

This paper proposes a novel dynamically reconfigurable switch for various multimedia applications in hybrid NoC systems. Current NoC systems, which adopt hybrid NoC structure with fixed switch and job distribution algorithms, require designers to precisely predict the property of applications to be processed. This paper proposes a reconfigurable switch which minimizes buffer overflow in various multimedia applications running on an NoC system. To verify the performance of the proposed system, we performed experiments on various multimedia applications running on embedded systems, such as MPEG4 and MP3 decoder, GPS positioning system, and OFDM demodulator. Experimental results show that buffer overflow has been decreased by 41.8% and 29.0%, respectively, when compared with NoC systems having sub-clusters with mesh or star topology. Power usage has been increased by 2.3% compared with hybrid NoC systems using fixed switches, and chip area has been increased from -0.6% to 5.7% depending on sub-cluster topology.

• Journal of Power Electronics
• /
• v.18 no.4
• /
• pp.1037-1050
• /
• 2018

This paper presents a novel reconfigurable selective harmonic elimination technique to control harmonics over a wide range of Modulation Indexes (MI) in Multi-Level Inverter (MLI). In the proposed method, the region of the MI is divided into various sectors and expressions are formulated with different switching patterns for each of the sectors. A memetic BBO-MAS (Biogeography Based Optimization - Mesh Adaptive direct Search) optimization algorithm is proposed for solving the Selective Harmonic Elimination - Pulse Width Modulation (SHE-PWM) technique. An experimental prototype is developed using a Field Programmable Gate Array (FPGA) and their FFT spectrums are analyzed over a wide range of MI using a fluke power logger. Simulation and experimental results have validated the performance of the proposed optimization algorithms and the reconfigurable SHE-PWM technique. Further, the sensitivity of the harmonics has been analyzed considering non-integer variations in the magnitude of the input DC sources.