• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.7
• /
• pp.421-428
• /
• 2006

In this paper, the way of remote installation and back-up of 3-tier structure is introduced for efficient utilizing the cluster system resources distributed at several places. Recently, cluster system is constructed as the system of over hundreds nodes under complex network system mixed with public networks and private networks. Therefore, the as installation method suitable for the large scale cluster system and the remote recovery of failure nodes are important. However the previous researches which are based on 2-tier architecture may not provide the efficient cluster installation and image back-up method when the network of cluster system is composed of several private networks and public networks. In this paper, RISE (Remote Installation Service and Environment) based on the 3-tier architecture is proposed to solve this problem. In our approach, the managing node's role is divided into the global master node (GRISE) and the local master node (LRISE) to provide the efficient initial system deployment and remote failure recovery of distributed cluster system under the various network systems. Also, LRISE's availability is ensured under the complex network environments by adopting the auto-synchronization mechanism between GRISE and LRISE. In this work, a 64-node cluster system with gigabit network system is utilized for the experiment. From the experimental result, the system image with 1.86GB data can be obtained in 5 minutes and 53 seconds and the image-based installation of 64-node system can be carried out in 17 minutes and 53 seconds.

• Animal cells and systems
• /
• v.2 no.4
• /
• pp.439-449
• /
• 1998

To discuss the taxonomic dispositions of Korean Isopyroideae (Ranunculaceae) taxa, principal components analysis and cluster analysis were performed using quantitative and qualitative morphological characters. The principal components analysis revealed that the size and number of ovule, ovary width, ratio of style length/ovary length, filament length, sepal size, style length, leaf size, and ovary length are important characters to distinguish Korean Isopyroideae taxa. The cluster and principal components analyses based on both quantitative and quantitative characters demonstrate that lsopyrum mandshuricum is more closely related to Enemion raddeanum than to Semiaquilegia adoxoides. Even though Enemion s not separated from Isopyrum by uantitative characters, they are distinguished by qualitative characters, suggesting that our taxa, Enemion, Semiaquilegia, Isopyrum and Aquilegia, should be recognized in Korean Isopyroideae. In addition, cluster analyses suggest that S. adoxoides could be separated from Aquilegia buergeriana var, oxysepala.

• 한국전산유체공학회:학술대회논문집
• /
• 2005.04a
• /
• pp.41-46
• /
• 2005

A new PC cluster was designed and constructed based on Windows XP Operating system. Primary target of the present design was the high node density per rack by using the general PC parts those are cost-effective and readily available in the market. Other major design points were system cooling and the convenient maintenance using standard PC parts. Presently 24 nodes per rack seems to be optimum considering the specification of the network switching device, system cooling and power supply, but 40 nodes can be accommodated within a single rack at maximum. Windows XP was selected as a high-performance computing environment considering the cost and the convenience in acquisition, maintenance and education. Both fast-Ethernet and Gigabit Ethernet network connection were tested and compared with previous data, especially for Linux doter using Myrinet. The result shows that there is no significant difference between the operating systems and the Fast-Ethernet and/or Gigabit Ethernet are good solution for the high-performance PC cluster considering the cost and performance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.12
• /
• pp.3815-3835
• /
• 2022

Density-based outlier detection is one of the hot issues in data mining. A point is determined as outlier on basis of the density of points near them. The existing density-based detection algorithms have high time complexity, in order to reduce the time complexity, a new outlier detection algorithm DODMD (Density-based Outlier Detection in Multidimensional Datasets) is proposed. Firstly, on the basis of ZH-tree, the concept of micro-cluster is introduced. Each leaf node is regarded as a micro-cluster, and the micro-cluster is calculated to achieve the purpose of batch filtering. In order to obtain n sets of approximate outliers quickly, a greedy method is used to calculate the boundary of LOF and mark the minimum value as LOF_min. Secondly, the outliers can filtered out by LOF_min, the real outliers are calculated, and then the result set is updated to make the boundary closer. Finally, the accuracy and efficiency of DODMD algorithm are verified on real dataset and synthetic dataset respectively.

• Journal of Industrial Technology
• /
• v.43 no.1
• /
• pp.49-55
• /
• 2023

Cluster tools are extensively employed in various wafer fabrication processes within the semiconductor manufacturing industry, including photo lithography, etching, and chemical vapor deposition. Contemporary fabrication facilities encounter customer orders with technical specifications that are similar yet slightly varied. Consequently, modern fabrications concurrently manufacture two or three different wafer types using a cluster tool to maximize chamber utilization and streamline the flow of wafer lots between different process stages. In this review, we introduce two methods of concurrent processing of multiple wafer types: 1) concurrent processing of multiple wafer types with different job flows, 2) concurrent processing of multiple wafer types with identical job flows. We describe relevant research trends and achievements and discuss future research directions.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.2
• /
• pp.1-10
• /
• 2010

Mapping virtual process topology to physical processor topology is one of the most important design issues in parallel programming. However, the mapping problem is complicated due to the topology irregularity and routing complexity. This paper proposes a new process mapping scheme called adjacency-based mapping (AM) for irregular cluster systems assuming that the two-dimensional mesh process topology is specified as an interprocess communication pattern. The cluster systems have been studied and developed for many years since they provide high interconnection flexibility, scalability, and expandability which are not attainable in traditional regular networks. The proposed AM tries to map neighboring processes in virtual process topology to adjacent processors in physical processor topology. Simulation study shows that the proposed AM results in better mapping quality and shorter interprocess latency compared to the conventional approaches.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.4
• /
• pp.192-200
• /
• 2002

The performance of a PC cluster system is limited by the use of traditional communication protocols, such as TCP/IP because these protocols are accompanied with significant software overheads. To overcome the problem, systems based on user-level interface for message passing without intervention of kernel have been developed. The VIA(Virtual Interface Architecture) is one of the representative user-level interfaces which provide low latency and high bandwidth. In this paper, a VIA system is implemented on an SCI(Scalable Coherent Interface) network based PC cluster. The system provides both message-passing and shared-memory programming environments and shows the maximum bandwidth of 84MB/s and the latency of $8{\mu}s$. The system also shows better performance in comparison with other comparable computer systems in carrying out parallel benchmark programs.

• Journal of Microbiology and Biotechnology
• /
• v.32 no.9
• /
• pp.1110-1119
• /
• 2022

Fe-S clusters are versatile and essential cofactors that participate in multiple and fundamental biological processes. In Escherichia coli, the biogenesis of these cofactors requires either the housekeeping Isc pathway, or the stress-induced Suf pathway which plays a general role under conditions of oxidative stress or iron limitation. In the present work, the Fe-S cluster assembly Isc and Suf systems of acidophilic Bacteria and Archaea, which thrive in highly oxidative environments, were studied. This analysis revealed that acidophilic microorganisms have a complete set of genes encoding for a single system (either Suf or Isc). In acidophilic Proteobacteria and Nitrospirae, a complete set of isc genes (iscRSUAX-hscBA-fdx), but not genes coding for the Suf system, was detected. The activity of the Isc system was studied in Leptospirillum sp. CF-1 (Nitrospirae). RT-PCR experiments showed that eight candidate genes were co-transcribed and conform the isc operon in this strain. Additionally, RT-qPCR assays showed that the expression of the iscS gene was significantly up-regulated in cells exposed to oxidative stress imposed by 260 mM Fe₂(SO₄)₃ for 1 h or iron starvation for 3 h. The activity of cysteine desulfurase (IscS) in CF-1 cell extracts was also upregulated under such conditions. Thus, the Isc system from Leptospirillum sp. CF-1 seems to play an active role in stressful environments. These results contribute to a better understanding of the distribution and role of Fe-S cluster protein biogenesis systems in organisms that thrive in extreme environmental conditions.

• The KIPS Transactions:PartA
• /
• v.10A no.6
• /
• pp.635-642
• /
• 2003

The radical development of recent network technology provides the basic foundation which can establish a high speed and cheap cluster system. It is a general trend that conventional cluster systems are built as the system over a fixed level based on stabilized and high speed local networks. A multi-distributed web cluster group is a web cluster model which can obtain high performance, high efficiency and high availability through mutual cooperative works between effective job division and system nodes through parallel performance of a given work and shared memory of SC-Server with low price and low speed system nodes on networks. For this, multi-distributed web cluster group builds a sub-cluster group bound with single imaginary networks of multiple system nodes and uses the web distributed shared memory of system nodes for the effective data transmission within sub-cluster groups. Since the presented model uses a load balancing and parallel computing method of large-scale work required from users, it can maximize the processing efficiency.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.5
• /
• pp.199-202
• /
• 2013

In the cluster mechanism of the wireless sensor network, the network lifetime is affected by how cluster heads are selected. One of the representative clustering mechanisms, the low-energy adaptive clustering hierarchy (LEACH), selects cluster heads periodically, resulting in high energy consumption in cluster reconstruction. On the other hand, the adaptive clustering algorithm via waiting timer (ACAWT) proposes a non-periodic re-clustering mechanism that reconstructs clusters if the remaining energy level of a cluster head reaches a given threshold. In this paper, we propose a re-clustering mechanism that uses multiple remaining node energy levels and does re-clustering when the remaining energy level of a cluster head reaches one level lower. Also, in determining cluster heads, both of the number of neighbor nodes and the remaining energy level are considered so that cluster heads can be more evenly placed. From the simulations based on the Qualnet simulator, we validate that our proposed mechanism outperforms ACAWT in terms of the network lifetime.