Go to the main menu
Skip to content
Go to bottom
REFERENCE LINKING PLATFORM OF KOREA S&T JOURNALS
> Journal Vol & Issue
KIISE Transactions on Computing Practices
Journal Basic Information
Journal DOI :
Korean Institute of Information Scientists and Engineers
Editor in Chief :
Volume & Issues
Volume 20, Issue 12 - Dec 2014
Volume 20, Issue 11 - Nov 2014
Volume 20, Issue 10 - Oct 2014
Volume 20, Issue 9 - Sep 2014
Selecting the target year
Limiting CPU Frequency Scaling Considering Main Memory Accesses
Park, Moonju ;
KIISE Transactions on Computing Practices, volume 20, issue 9, 2014, Pages 483~491
DOI : 10.5626/KTCP.2014.20.9.483
Contemporary computer systems exploits DVFS (Dynamic Voltage/Frequency Scaling) technology for balancing performance and power consumption. The efficiency of DVFS depends on how much performance we get for larger power consumption due to elevated CPU frequency. Especially for memory-bounded applications, higher CPU frequency often does not result in higher performance. In this paper, we present an upper bound of CPU frequency scaling based on memory accesses. It is observed that the performance gain due to higher CPU frequency is limited by memory accesses (last level cache misses) per instructions by experiments. Using the results, we present the CPU frequency upper bound with little performance gain. Experimental results show that for a memory-bounded application, applying the frequency upper bound enhances the energy efficiency of the application by above 30%.
Opinion Retrieval in Twitter Considering Syntactic Relations of Sentiment Phrase
Kim, Yoonsung ; Yang, Min-Chul ; Lee, Seung-Wook ; Rim, Hae-Chang ;
KIISE Transactions on Computing Practices, volume 20, issue 9, 2014, Pages 492~497
DOI : 10.5626/KTCP.2014.20.9.492
In this paper, we propose a method of retrieving opinioned tweets in Twitter, which is the one of the popular Social Network Services and shares diverse opinions among various users. In typical opinion retrieval systems, they may consider the presence of sentiment phrases (subjectivity) as the important factor even if the subjective phrases are not related to a given query or speaker. To alleviate these problems, we utilized the syntactic structure of a sentence to identify the relationships between 1) subjectivity-query and 2) subjectivity-speaker and 3) the syntactic role of subjectivity. Besides, our learning-to-rank approach is trained to retrieve opinioned tweets based on query-relevance, textual features, user information, and Twitter-specific features. Experimental results on real world data show that our proposed method can achieve better performance than several baseline methods in terms of precision and nDCG.
Accuracy Improvement Methods for String Similarity Measurement in POI(Point Of Interest) Data Retrieval
Ko, EunByul ; Lee, JongWoo ;
KIISE Transactions on Computing Practices, volume 20, issue 9, 2014, Pages 498~506
DOI : 10.5626/KTCP.2014.20.9.498
With the development of smart transportation, people are likely to find their paths by using navigation and map application. However, the existing retrieval system cannot output the correct retrieval result due to the inaccurate query. In order to remedy this problem, set-based POI search algorithm was proposed. Subsequently, additionally a method for measuring POI name similarity and POI search algorithm supporting classifying duplicate characters were proposed. These algorithms tried to compensate the insufficient part of the compensate set-based POI search algorithm. In this paper, accuracy improvement methods for measuring string similarity in POI data retrieval system are proposed. By formulization, similarity measurement scheme is systematized and generalized with the development of transportation. As a result, it improves the accuracy of the retrieval result. From the experimental results, we can observe that our accuracy improvement methods show better performance than the previous algorithms.
The Need of Cache Partitioning on Shared Cache of Integrated Graphics Processor between CPU and GPU
Sung, Hanul ; Eom, Hyeonsang ; Yeom, HeonYoung ;
KIISE Transactions on Computing Practices, volume 20, issue 9, 2014, Pages 507~512
DOI : 10.5626/KTCP.2014.20.9.507
Recently, Distributed computing processing begins using both CPU(Central processing unit) and GPU(Graphic processing unit) to improve the performance to overcome darksilicon problem which cannot use all of the transistors because of the electric power limitation. There is an integrated graphics processor that CPU and GPU share memory and Last level cache(LLC). But, There is no LLC access rules between CPU and GPU, so if GPU and CPU processes run together at the same time, performance of both processes gets worse because of the contention on the LLC. This Paper gives evidence to prove the need of the Cache Partitioning and is mentioned about the cache partitioning design using page coloring to allocate the L3 Cache space only for the GPU process to guarantee GPU process performance.
Workflow for Building a Draft Genome Assembly using Public-domain Tools: Toxocara canis as a Case Study
Won, JungIm ; Kong, JinHwa ; Huh, Sun ; Yoon, JeeHee ;
KIISE Transactions on Computing Practices, volume 20, issue 9, 2014, Pages 513~518
DOI : 10.5626/KTCP.2014.20.9.513
It has become possible for small scale laboratories to interpret large scale genomic DNA, thanks to the reduction of the sequencing cost by the development of next generation sequencing (NGS). De novo assembly is a method which creates a putative original sequence by reconstructing reads without using a reference sequence. There have been various study results on de novo assembly, however, it is still difficult to get the desired results even by using the same assembly procedures and the analysis tools which were suggested in the studies reported. This is mainly because there are no specific guidelines for the assembly procedures or know-hows for the use of such analysis tools. In this study, to resolve these problems, we introduce steps to finding whole genome of an unknown DNA via NGS technology and de novo assembly, while providing the pros and cons of the various analysis tools used in each step. We used 350Mbp of Toxocara canis DNA as an application case for the detailed explanations of each stated step. We also extend our works for prediction of protein-coding genes and their functions from the draft genome sequence by comparing its homology with reference sequences of other nematodes.
Linux-based Memory Efficient Partition Scheduler using Partition Bitmap
Kwon, Cheolsoon ; Joe, Hyunwoo ; Kim, Duksoo ; Kim, Hyungshin ;
KIISE Transactions on Computing Practices, volume 20, issue 9, 2014, Pages 519~524
DOI : 10.5626/KTCP.2014.20.9.519
The operating systems in the system architecture, which is integrated several applications and modular electronic devices in the same computing device, demand partitioning technology for safety. Thus, operation system requires partition scheduler for partition scheduling. When we design partition scheduler in embedded system, which has small memory and low performance, such as space system, we must consider not only performance but also memory. In this paper, we introduces a linux-based memory efficient partition scheduler using partition bitmap. This partition scheduler demands small memory space and produce low partition switching overhead. The prototype was executed on a LEON4 processor, which is the Next Generation Multicore Processor (NGMP) in the space sector. In evaluation, this prototype shows accuracy, additional memory space and low partition switching overhead.