• International Journal of Precision Engineering and Manufacturing
• /
• v.4 no.5
• /
• pp.27-33
• /
• 2003

G-code, another name of ISO6983, has been a popular commanding language for operating machine tools. This G-code, however, limits the usage of today's fast evolving high-performance hardware. For intelligent machines, the communications between machine and CAD/CAM departments become important, but the loss of information during generating G-code makes the production department isolated. The new standard for operating machine tools, named STEP-NC is just about to be standardized as ISO14649. As this new standard stores CAD/CAM information as well as operation commands of CNC machines, and this characteristic makes this machine able to exchange information with other departments. In this research, the new CNC machine operated by STEP-NC was built and tested. Unlike other prototypes of STEP-NC milling machines, this system uses the STEP-NC file in XML file form as data input. This machine loads information from XML file and deals with XML file structure. It is possible for this machine to exchange information to other databases using XML. The STEP-NC milling machines in this research loads information from the XML file, makes tool paths for two5D features with information of STEP-NC, and machines automatically without making G-code. All software is programmed with Visual $C^{++}$, and the milling machine is built with table milling machine, step motors, and motion control board for PC that can be directly controlled by Visual $C^{++}$ commands. All software and hardware modules are independent from each other; it allows convenient substitution and expansion of the milling machine. Example 1 in ISO14649-11 having the full geometry and machining information and example 2 having only the geometry and tool information were used to test the automatic machining capability of this system.

• Journal of Advanced Marine Engineering and Technology
• /
• v.38 no.10
• /
• pp.1281-1286
• /
• 2014

This paper presents an iterative learning control (ILC) approach for tracking problems with specified data points that are desired points at certain time instants. To design ILC systems for such problems, unlike traditional ILC approaches, an algorithm which updates not only the control signal but also the reference trajectory at each trial will be developed. The relationship between the reference trajectory and ILC control in tracking problems where there are specified data points through which the system should pass is investigated as the rate of convergence. In traditional ILC, the desired data is stored in a tracking profile file. Due to the huge size of the data file containing the target points, it is important to reduce the computational cost. Finally, simulation results of the presented technique are mentioned and compared to other related works to confirm the effectiveness of proposed scheme.

• International Journal of Contents
• /
• v.4 no.1
• /
• pp.16-19
• /
• 2008

In this paper, we propose to new dispatcher method, which doesn't depend on an operating system of the server, and the direct routing method, by which a server answers a client's request at first hand. And, propose new web clustering scheme based on the contents on the web where web servers composed of cluster, with each different contents, answer client's request. The other purposes are to reduce overhead of the dispatcher through load balance, and to minimize the time to take in responding to a client's request. The performance of new web cluster scheme was improved by about 39% than that of the existing RR method. It was identified that the performance of the proposed web cluster method was extraordinary improved comparing with that of the existing RR method as a whole.

• ETRI Journal
• /
• v.29 no.3
• /
• pp.281-291
• /
• 2007

Wearable computers consisting of various small devices such as smart phones, digital cameras, MP3 players and specialized I/O devices in personal area networks will play an important role in future ubiquitous computing. In this environment, accessing user data is quite complex due to the dynamic and heterogeneous characteristics of the underlying networks. Moreover, since the amount of user data increases rapidly, automatic data backup management is also critical. To overcome these challenges, several studies have been conducted including our previously proposed file service system, PosCFS, which could be adapted to the requirements with a virtualization technique allowing per-user global namespace for managing and accessing data stored on physical storage spaces detected in PAN. In this paper, we present a smart file service framework, PosCFS+ which is an improved and extended version of our previous work. Performance improvement is made possible by redesigning the metadata management scheme based on database and keywords rather than ontology. In addition, the automatic data replication management is newly designed based on the OSD protocol.

• Journal of Korea Multimedia Society
• /
• v.8 no.7
• /
• pp.924-942
• /
• 2005

Recently, large-scale directories have been developed for LINUX cluster file systems to store and retrieve huge amount of data. One of them, GFS directory, has attracted much attention because it is based on extendible hashing, one of dynamic hashing techniques, to support fast access to files. One distinctive feature of the GFS directory is the flat structure where all the leaf nodes are located at the same level of the tree. Hut one disadvantage of the mode structure is that the height of the mode tree has to be increased to make the tree flat after a byte is inserted to a full tree which cannot accommodate it. Thus, one byte addition makes the height of the whole mode tree grow, and each data block of the new tree needs one more link access than the old one. Another dynamic hashing technique which can be used for directories is linear hashing and a couple of researches have shown that it can get better performance at file access times than extendible hashing. [n this research, we have designed and implemented an extendible hashing directory and a linear hashing directory for large-scale LINUX cluster file systems and have compared performance between them. We have used the semi-flat structure which is known to have better access performance than the flat structure. According to the results of the performance evaluation, the linear hashing directory has shown slightly better performance at file inserts and accesses in most cases, whereas the extendible hashing directory is somewhat better at space utilization.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.11
• /
• pp.1515-1527
• /
• 2016

With the growth of big data, machine learning, and cloud computing, the importance of storage that can store large amounts of unstructured data is growing recently. So the commodity hardware based distributed file systems such as MAHA-FS, GlusterFS, and Ceph file system have received a lot of attention because of their scale-out and low-cost property. For the data fault tolerance, most of these file systems uses replication in the beginning. But as storage size is growing to tens or hundreds of petabytes, the low space efficiency of the replication has been considered as a problem. This paper applied erasure coding data fault tolerance policy to MAHA-FS for high space efficiency and introduces VDelta technique to solve data consistency problem. In this paper, we compares the performance of two file systems, MAHA-FS and GlusterFS. They have different IO processing architecture, the former is server centric and the latter is client centric architecture. We found the erasure coding performance of MAHA-FS is better than GlusterFS.

• Journal of KIISE:Computing Practices and Letters
• /
• v.7 no.5
• /
• pp.402-415
• /
• 2001

Advantages of flash memories are their shock resistance and fast read speed, which is much faster than that of a HDD. Because of these characteristics, they are increasingly used in the traditional household electric appliance and portable handset and therefore, development of file systems which use them as storage medium is increasingly needed. But they have two problems as storage medium. First, data stored in them cannot be overwritten: it must be erased before new data can be stored. Unfortunately, this erase operation usually takes about one second. Consequently, updating data in flash memories takes long time. In this paper, their problem is solved by using a data update mechanism like LFS(Log-structured File System). Second, their erase operations are restricted. We propose novel cleaning policy in order to increase the life cycle. We implemented FAT file system, which is suitable to small storage medium and solved problems, which usually happen in implementing FAT. We evaluated the performance of sequential writes and random writes on our implemented flash file system.

• The KIPS Transactions:PartA
• /
• v.10A no.2
• /
• pp.83-92
• /
• 2003

RAID 5 is a widely-used technique used to construct disk systems of high reliability and performance. This paper proposes APGOC (Adaptive Parity Group On Cache) organization on cache to solve "small write" problem of RAID 5 especially in OLTP (On-Line Transaction Processing System) environments. In our approach, when user process makes a request for a file to kernel, the information on the read/write characteristics is added to the file data structure of the file system. With this information, data and parity cache can be managed interchangeably through parity fetching. Therefore we can enhance the cache utilization and improve the disk request response time. Our method is analyzed and evaluated with a simulation method. Comparing with previous works, we observed about 6~l3% of performance enhancement.hancement.

• Journal of Nuclear Fuel Cycle and Waste Technology(JNFCWT)
• /
• v.17 no.2
• /
• pp.227-234
• /
• 2019

A user-friendly modeling interface is developed for a process-based total system performance assessment framework (APro) specialized for a generic geological disposal system for high-level radioactive waste. The APro modeling interface is constructed using MATLAB, and the operator splitting scheme is used to combine COMSOL for simulation of multiphysics and PHREEQC for the calculation of geochemical reactions. As APro limits the modeling domain to the generic disposal system, the degree of freedom of the model is low. In contrast, the user-friendliness of the model is improved. Thermal, hydraulic, mechanical and chemical processes considered in the disposal system are modularized, and users can select one of multiple modules: "Default process" and multi "Alternative process". APro mainly consists of an input data part and calculation execution part. The input data are prepared in a single EXCEL file with a given format, and the calculation part is coded using MATLAB. The final results of the calculation are created as an independent COMSOL file for further analysis.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.11
• /
• pp.599-609
• /
• 2007

Due to the restrictions of Flash memory such as overwrite limitation and write/erase operational unit differences, block cleaning is required in Flash memory based file systems and known as a key factor on the performance of file systems. In this paper, we identify three parameters, namely utilization, invalidity and uniformity, and analyze how the parameters affect the cost of block cleaning. The analysis show that as uniformity degrades, the cost of block cleaning increases drastically. To overcome this problem, we design a new modification-aware(MODA) page allocation scheme that strives to keep uniformity high by separating frequently-updating data from infrequently-updating data. Real implementation experiments conducted on an embedded system show that the MODA scheme can actually enhance uniformity of Flash memory, which consequently leads to reduce the cost of block cleaning with an average of 123%, compared to the traditional sequential allocation scheme that is used in YAFFS.