• Journal of KIISE
• /
• v.42 no.2
• /
• pp.169-176
• /
• 2015

The atomic write technique is a good solution to solve the problem of the double write buffer. The atomic write technique needs modified I/O subsystems (i.e., file system and I/O schedulers) and a special SSD that guarantees the atomicity of the write request. In this paper, we propose the writing unit aligned block allocation technique (for EXT4 file system) and the merge prevention of requests technique for the CFQ scheduler. We also propose an atomic write-supporting SSD which stores the atomicity information in the spare area of the flash memory page. We evaluate the performance of the proposed atomic write scheme in MariaDB using the tpcc-mysql and SysBench benchmarks. The experimental results show that the proposed atomic write technique shows a performance improvement of 1.4~1.5 times compared to the double write buffer technique.

• Journal of the Korea Society of Computer and Information
• /
• v.8 no.2
• /
• pp.112-121
• /
• 2003

Information Protection and cryptography technology is developed with if but solved problem of real time processing and secret maintain. Therefore this paper is Proposed new PRN-SEED(Pseudo-Random Number-SEED) for the increasing secret rate and processing rate perform performance analysis with existed other cryptography algorithms. Proposed new PRN-SEED crypto-algorithm increase in the processing rate than existed algorithms use bit and byte mixed operation with RNG(Random Number Generator). PRN-SEED that performs simultaneous operations have higher 1.03 in the processing rate and 2 in the cryptosystem performance than existed cryptosystems. Implementation for PRN-SEED use Synopsys Design Analyser Ver. 1999.10, samsung KG75 library and Synopsys VHDL Debegger. As a simulation result, symmetric cryptosystem DES operate 416Mbps at the 40MHz and Rijndael operate 612Mbps at the 50MHz. PRN-SEED cryptosystem have gate counting 10K and operate 430Mbps at the 40MHz and 630Mbps at the 50MHz.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.3
• /
• pp.73-80
• /
• 2010

The advancement of communication and networking technologies has enabled e-science and commercial application that often require the transport of large volume of data over wide-area network. Schedulable high-bandwidth low-latency connectivity is required to transport the large volume of data. But the public Internet does not provide predictable service performance. Especially, if data providers and users are far away, dedicated bandwidth channels are needed to support remote process efficiently. Currently several network research projects are in progress to develop dedicated connectionsy sA bandwidth scheduler computes an user requested path based on network topology information and link bandwidth allocationsy In this paper, we have proposed an efficient algorithm for finding the earliest time interval when minimum bandwidth and duration are giveny Our algorithm is experimentally compared with the known algorithm.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.10 no.4
• /
• pp.78-85
• /
• 2011

In vehicle ad-hoc network (VANET) environments, traffic related information such as accident information, emergency information and real time traffic condition have to be delivered to on-board-unit (OBU) or/and road-side-equipment (RSE) for preventing traffic accidents in advance. In this paper, we introduce a Multi-Channel MAC (MCM) since the existing single channel operation may cause packet transmission delay and unexpected communication failure. To offer a seamless safety message transmission during the various services, it is necessary to manage the MAC scheduler in wireless access in vehicular environments (WAVE) systems. The MCM consists of MAC softwares and MAC hardwares where the former and the later ones are implemented with real time operation system based C language and FPGA module with VHDL language, respectively. The performance and QoS are verified by practical measurements and compared with the scheme using single channel operation.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.48 no.11
• /
• pp.60-66
• /
• 2011

LTE (Long Term Evolution) supports QoS (Quality of Service) with several service classes. For each class of traffic, a big difference exists on BER (Bit Error Rate) requirement. This leads to a considerable difference in transmission power for various classes of traffic. In this paper, a novel scheduler is designed and proposed for LTE which supports CoS (Class of Service) with the consideration of priority as well as target BER. By the CQI (Channel Quality Indicator) and QCI (QoS Class Identifier), a minimum transmission power is assigned from the target BER for each class of traffic per each user. Hence, with the other information such as user's used rate in the past and the priority of traffic, the probability of occupying channels is determined. The simulation results of Service Class scheduling are compared with that of Maximum Rate and Proportional Fair. The results show that the service class-aided scheduling can improve the throughput of whole system significantly.

• The Bulletin of The Korean Astronomical Society
• /
• v.41 no.1
• /
• pp.54.3-55
• /
• 2016

DEEP-South Scheduling and Data reduction System (DS SDS) consists of two separate software subsystems: Headquarters (HQ) at Korea Astronomy and Space Science Institute (KASI), and SDS Data Reduction (DR) at Korea Institute of Science and Technology Information (KISTI). HQ runs the DS Scheduling System (DSS), DS database (DB), and Control and Monitoring (C&M) designed to monitor and manage overall SDS actions. DR hosts the Moving Object Detection Program (MODP), Asteroid Spin Analysis Package (ASAP) and Data Reduction Control & Monitor (DRCM). MODP and ASAP conduct data analysis while DRCM checks if they are working properly. The functions of SDS is three-fold: (1) DSS plans schedules for three KMTNet stations, (2) DR performs data analysis, and (3) C&M checks whether DSS and DR function properly. DSS prepares a list of targets, aids users in deciding observation priority, calculates exposure time, schedules nightly runs, and archives data using Database Management System (DBMS). MODP is designed to discover moving objects on CCD images, while ASAP performs photometry and reconstructs their lightcurves. Based on ASAP lightcurve analysis and/or MODP astrometry, DSS schedules follow-up runs to be conducted with a part of, or three KMTNet telescopes.

• The Bulletin of The Korean Astronomical Society
• /
• v.41 no.1
• /
• pp.54.2-54.2
• /
• 2016

Korea Microlensing Telescope Network (KMTNet) is the first optical survey system of its kind in a way that three KMTNet observatories are longitudinally well-separated, and thus have the benefit of 24-hour continuous monitoring of the southern sky. The wide-field and round-the-clock operation capabilities of this network facility are ideal for survey and the physical characterization of small Solar System bodies. We obtain their orbits, absolute magnitudes (H), three dimensional shape models, spin periods and spin states, activity levels based on the time-series broadband photometry. Their approximate surface mineralogy is also identified using colors and band slopes. The automated observation scheduler, the data pipeline, the dedicated computing facility, related research activity and the team members are collectively called 'DEEP-South' (DEep Ecliptic Patrol of Southern sky). DEEP-South observation is being made during the off-season for exoplanet search, yet part of the telescope time is shared in the period between when the Galactic bulge rises early in the morning and sets early in the evening. We present here the observation mode, strategy, software, test runs, early results, and the future plan of DEEP-South.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.3
• /
• pp.288-298
• /
• 1995

Load balancing attempts to improve the performance of a distributed computing system by transferring some of the workload of a congested site to others. A load balancing scheme that supports both the source-initiated and the server- initiated load balancing is proposed in this paper. It can model both the m/m/1 queue(no load balancing) and the m/m/n queue(perfect load balancing) as the extreme State variables are replicated into every site, and copy consistency constraints are relaxed more weakly. We propose weak copy consistency constraints which correlate the outdated state information to that of the current state. We also derive sufficient conditions under which each scheduler can guarantee the load balancing without communication Using this model, the problem of load balancing is converted to that of maintaining the consistency of states and communication overhead becomes less than that of the bidding algorithm. The scheme is simulated by event tracing, compared to the two extreme cases and the bidding algorithm. The results show that the mean response time and the number of messages are reduced by 0-35% and 40-100% respectively, compared with the bidding algorithm. Finally the effects of some system parameters are described.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.5S
• /
• pp.1666-1675
• /
• 2000

This paper proposes a RTWM (Real-Time Web Middleware) framework for real-time EC(Electronic Commerce) systems. RTWM system is extended the existing COS( CORBA Object Service) model added to the event monitoring, real-time scheduler, real-time event filtering for supporting real-time concept of EC systems. Especially, this paper is concentrated on providing suitable event filtering function for EC system in order to meed various user time requirements under distributed system environment. It stores time constraint requirements an interesting event information input from users into QoS repository, then processes the data through appropriate RTFA(Real-Time Filtering Agent) module when real-time events occur. From this method, users can get the filtered event result reflected their requirements about real-time filtering. It means this system provides thigh QoS to users. In addition, it results in decreasing network traffic as unnecessary event information is filtered from network.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.1B
• /
• pp.11-17
• /
• 2003

In this paper, we presented the dynamic random access channel allocation method under the priority based scheduling policy in order to improve the system performance of HIPERLAN/2 standardized by ETSI According to the scheduling policy, AP scheduler primarily allocates the resource to the collision MT This scheduling policy bring about decreasing the transmission delay of collision MT Dynamic RCH(random access channel) allocation method decreases the collision probability by increasing the number of RCH slots in case of low traffic. While it increases the maximum throughput by increasing the number of the data transmission slots in case of high traffic Therefore dynamic allocation method of RCH slots decreases the scheduling delay and increases the throughput When we evaluate the performance of presented method based on standards, we saw that the presented method improve the performance of the MAC protocol in terms of throughput and transmission delay.