• Journal of Korea Multimedia Society
• /
• v.13 no.8
• /
• pp.1183-1193
• /
• 2010

The pyramid graph is well known in parallel processing as a interconnection network topology based on regular square mesh and tree architectures. The enhanced pyramid graph is an alternative architecture by exchanging mesh into the corresponding torus on the base for upgrading performance than the pyramid. In this paper, we adopt a strategy of classification into two disjoint groups of edges in regular square torus as a basic sub-graph constituting of each layer in the enhanced pyramid graph. Edge set in the torus graph is considered as two disjoint sub-sets called NPC(represents candidate edge for neighbor-parent) and SPC(represents candidate edge for shared-parent) whether the parents vertices adjacent to two end vertices of the corresponding edge have a relation of neighbor or sharing in the upper layer of the enhanced pyramid graph. In addition, we also introduce a notion of shrink graph to focus only on the NPC-edges by hiding SPC-edges within the shrunk super-vertex on the resulting shrink graph. In this paper, we analyze that the lower and upper bounds on the number of NPC-edges in a Hamiltonian cycle constructed on $2^n{\times}2^n$ torus is $2^{2n-2}$ and $3{\cdot}2^{2n-2}$ respectively. By expanding this result into the enhanced pyramid graph, we also prove that the maximum number of NPC-edges containable in a Hamiltonian cycle is $4^{n-1}$-2n+1 in the n-dimensional enhanced pyramid.

• Magazine of the Korea Concrete Institute
• /
• v.8 no.1
• /
• pp.145-153
• /
• 1996

The fracture process zone in concrete is a region ahead of a traction-free crack, in which two major mechanisms, microcracking and bridging, play important roles. The toughness due to bridging is dominant compared to toughness induced by microcracking, so that the bridging is dominani: mechanism governing the fracture process of concrete. Fracture mechanics does work for concrete provided that the fracture process zone is being considered, so that the development of model for the fracture process zone is most important to describe fracture phenomena in concrete. In this paper the bridging zone, which is a part of extended rnacrocrack with stresses transmitted by aggregates in concrete, is modelled by a Dugdale-Barenblatt type model with linear tension-softening curve. Two finite element techniques are shown for the analysis of progressive cracking in concrete based on the discrete crack approach: one with crack element, the other without crack element. The advantage of the technique with crack element is that it dees not need to update the mesh topology to follow the progressive cracking. Numerical results by the techniques are demonstrated.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.7
• /
• pp.131-139
• /
• 2013

To overcome the limitations in performance and power consumption of traditional electrical interconnection based network-on-chips (NoCs), a hybrid optical network-on-chip (HONoC) architecture using optical interconnects is emerging. However, the HONoC architecture should use circuit-switching scheme owing to the overhead by optical devices, which worsens the latency unfairness problem caused by frequent path collisions. This resultingly exert a bad influence in overall performance of the system. In this paper, we propose a new task mapping algorithm for optimizing latency by reducing path collisions. The proposed algorithm allocates a task to a certain processing element (PE) for the purpose of minimizing path collisions and worst case latencies. Compared to the random mapping technique and the bandwidth-constrained mapping technique, simulation results show the reduction in latency by 43% and 61% in average for each $4{\times}4$ and $8{\times}8$ mesh topology, respectively.

• Magazine of the Korea Concrete Institute
• /
• v.7 no.4
• /
• pp.149-156
• /
• 1995

The fracture process zone in concrete is a region ahead of a traction-free crack, in which two major mechanisms, microcracking and bridging, play important roles. The toughness due to bridging is dominant compared to toughness induced by microcracking, so that the bridging is dominani: mechanism governing the fracture process of concrete. Fracture mechanics does work for concrete provided that the fracture process zone is being considered, so that the development of model for the fracture process zone is most important to describe fracture phenomena in concrete. In this paper the bridging zone, which is a part of extended rnacrocrack with stresses transmitted by aggregates in concrete, is modelled by a Dugdale-Barenblatt type model with linear tension-softening curve. Two finite element techniques are shown for the analysis of progressive cracking in concrete based on the discrete crack approach: one with crack element, the other without crack element. The advantage of the technique with crack element is that it dees not need to update the mesh topology to follow the progressive cracking. Numerical results by the techniques are demonstrated.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.5
• /
• pp.1180-1192
• /
• 1996

On demand of many users, basic networks of a parallel computer system are required to have a property that can embed various topologies. Bisectional interconnection network is known to satisfy this property, and it can embed various topologies optimally. Nowadays one is very interested in the hypercube as a message pssing multicomputer system, so it is very important to implement a hypercube in bisectional network. In this paper, a hypercube is implemented in a versatile bisecional netork, and its routing and broadcasting algorithm are proposed. Conventional bisectional network can accomodata linear array, complete binary tree and mesh structure as its topology. Now hypercube is implemented to be utilized as a general purpose supercomputercommunication architecture. The proposed routing and broadcasting algorithm embedded in bisectional network are general purpose algorithms which satisfy property of conventional hypercube.

• Magazine of the Korea Concrete Institute
• /
• v.6 no.3
• /
• pp.201-214
• /
• 1994

The fracture process zone in concrete is a region ahead of a traction-free crack, in which two major mechanisms, microcracking and bridging, play important roles. The toughness due to bridging is dominant compared to toughness induced by microcracking, so that the bridging is dominani: mechanism governing the fracture process of concrete. Fracture mechanics does work for concrete provided that the fracture process zone is being considered, so that the development of model for the fracture process zone is most important to describe fracture phenomena in concrete. In this paper the bridging zone, which is a part of extended rnacrocrack with stresses transmitted by aggregates in concrete, is modelled by a Dugdale-Barenblatt type model with linear tension-softening curve. Two finite element techniques are shown for the analysis of progressive cracking in concrete based on the discrete crack approach: one with crack element, the other without crack element. The advantage of the technique with crack element is that it dees not need to update the mesh topology to follow the progressive cracking. Numerical results by the techniques are demonstrated.

• The KIPS Transactions:PartC
• /
• v.12C no.6 s.102
• /
• pp.891-900
• /
• 2005

This paper studies network recovery methods for WDM optical mesh networks, concentrating on improving spare resource utilization. The resource efficiency can be obtained by sharing spare resources needed for network recovery. To improve the sharability of spare resources in WDM networks, methods to share backup paths us well as spare capacity should be studied. The proposed method in this paper uses multiple ring-covers and this method provides fast and simple recovery operation by exploiting the characteristics of logical ring topology, and also provides efficient resource utilization by using multiple distributed backup paths to improve the sharability of overall spare resources in the networks. This method can provide layered reliability to network service by enabling hierarchical robustness against multiple failures. The performance results show that the proposed method provide improved resource efficiency for single failure and enhanced robustness for multiple failures.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.5
• /
• pp.196-208
• /
• 2005

In multiprocessor systems, interconnection network design is critical for overall system performance. Popular interconnection networks, which are generally considered, are meshes, rings, and hierarchical rings. In this paper, we propose (')Torus Ring('), which is a modified version of hierarchical ring. Torus Ring has the same complexity as the hierarchical rings, but the only difference is the way it connects the local rings. It has an advantage over the hierarchical rings when the destination of a packet is the neighbor local ring in the reverse direction. Though the average number of hops in Torus Ring is equal to that of the hierarchical rings when assuming the uniform distribution of each transaction, the benefits of the number of hops are expected to be larger because of the spatial locality in the real environment of parallel programming. In the simulation results, latencies in the interconnection network are reduced by up to 19$\%$, and the execution times are reduced by up to 10$\%$.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.06a
• /
• pp.188-194
• /
• 2007

We propose a new ad hoc multicast routing protocol for based on the ontology scheme called inference network. Ontology knowledge-based is one of the structure of context-aware. We will have developed an algorithm that will design multi-hierarchy Layered networks to simulate a desired system.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.9
• /
• pp.2221-2234
• /
• 1997

Distributed mutual exclusion algorithms have employed two approaches to achieve mutual exclusion and can be divided into two broad classes:token-based and permission-based. Token-based algorithms share a unique token among the nodes and a node is allowed to access its common resources if it possesses the token. Permission-based algorithms require one or more successive rounds of message exchanges among the nodes to obtain the permission to access the common resources. A hypercube architecture has earned wide acceptance in multiprocessor systems in the past few years because of its simple, yet rich topology. Accordingly, we study distributed permission-based mutual exclusion algorithms for hypercubes, and design a distributed permission-based mutual exclusion algorithm based on a new information structure adapted to the hypercubes. The new information structure is a request set of T-pattern from a logical mesh that is embedded into a hypercube. If a node wants to access the common resources, it sends request message to all nodes in the request set by Lan's multicast algorithm. Once the node receives a grant message from all nodes in the request set, it accesses the common resource. We evaluate our algorithm with respect to minimum round-trip delay, blocking delay, and the number of messages per access to the common resource.