Go to the main menu
Skip to content
Go to bottom
REFERENCE LINKING PLATFORM OF KOREA S&T JOURNALS
> Journal Vol & Issue
Journal of Computing Science and Engineering
Journal Basic Information
Journal DOI :
Korean Institute of Information Scientists and Engineers
Editor in Chief :
In-Sup Lee / Il-Yeol Song / Jong C. Park / Tae-Whan Kim
Volume & Issues
Volume 8, Issue 4 - Dec 2014
Volume 8, Issue 3 - Sep 2014
Volume 8, Issue 2 - Jun 2014
Volume 8, Issue 1 - Mar 2014
Selecting the target year
Analysis and Improvement of the Bacterial Foraging Optimization Algorithm
Li, Jun ; Dang, Jianwu ; Bu, Feng ; Wang, Jiansheng ;
Journal of Computing Science and Engineering, volume 8, issue 1, 2014, Pages 1~10
DOI : 10.5626/JCSE.2014.8.1.1
The Bacterial Foraging Optimization Algorithm is a swarm intelligence optimization algorithm. This paper first analyzes the chemotaxis, as well as elimination and dispersal operation, based on the basic Bacterial Foraging Optimization Algorithm. The elimination and dispersal operation makes a bacterium which has found or nearly found an optimal position escape away from that position, which greatly affects the convergence speed of the algorithm. In order to avoid this escape, the sphere of action of the elimination and dispersal operation can be altered in accordance with the generations of evolution. Secondly, we put forward an algorithm of an adaptive adjustment of step length we called improved bacterial foraging optimization (IBFO) after making a detailed analysis of the impacts of the step length on the efficiency and accuracy of the algorithm, based on chemotaxis operation. The classic test functions show that the convergence speed and accuracy of the IBFO algorithm is much better than the original algorithm.
An Exponential Smoothing Adaptive Failure Detector in the Dual Model of Heartbeat and Interaction
Yang, Zhiyong ; Li, Chunlin ; Liu, Yanpei ; Liu, Yunchang ; Xu, Lijun ;
Journal of Computing Science and Engineering, volume 8, issue 1, 2014, Pages 17~24
DOI : 10.5626/JCSE.2014.8.1.17
In this paper, we propose a new implementation of a failure detector. The implementation uses a dual model of heartbeat and interaction. First, the heartbeat model is adopted to shorten the detection time, if the detection process does not receive the heartbeat message in the expected time. The interaction model is then used to check the process further. The expected time is calculated using the exponential smoothing method. Exponential smoothing can be used to estimate the next arrival time not only in the random data, but also in the data of linear trends. It is proven that the new detector in the paper can eventually be a perfect detector.
Comparing Separate and Statically-Partitioned Caches for Time-Predictable Multicore Processors
Wu, Lan ; Ding, Yiqiang ; Zhang, Wei ;
Journal of Computing Science and Engineering, volume 8, issue 1, 2014, Pages 25~33
DOI : 10.5626/JCSE.2014.8.1.25
In this paper, we quantitatively compare two different time-predictable multicore cache architectures, separate and statically-partitioned caches, through extensive simulation. Current research trends primarily focus on partitioned-cache architectures in order to achieve time predictability for hard real-time multicore based systems, and our experiments reveal that separate caches actually lead to much better performance and energy efficiency when compared to statically-partitioned caches, and both of them are adequate for timing analysis for real-time multicore applications.
Exploiting Standard Deviation of CPI to Evaluate Architectural Time-Predictability
Zhang, Wei ; Ding, Yiqiang ;
Journal of Computing Science and Engineering, volume 8, issue 1, 2014, Pages 34~42
DOI : 10.5626/JCSE.2014.8.1.34
Time-predictability of computing is critical for hard real-time and safety-critical systems. However, currently there is no metric available to quantitatively evaluate time-predictability, a feature crucial to the design of time-predictable processors. This paper first proposes the concept of architectural time-predictability, which separates the time variation due to hardware architectural/microarchitectural design from that due to software. We then propose the standard deviation of clock cycles per instruction (CPI), a new metric, to measure architectural time-predictability. Our experiments confirm that the standard deviation of CPI is an effective metric to evaluate and compare architectural time-predictability for different processors.
SS-DRM: Semi-Partitioned Scheduling Based on Delayed Rate Monotonic on Multiprocessor Platforms
Senobary, Saeed ; Naghibzadeh, Mahmoud ;
Journal of Computing Science and Engineering, volume 8, issue 1, 2014, Pages 43~56
DOI : 10.5626/JCSE.2014.8.1.43
Semi-partitioned scheduling is a new approach for allocating tasks on multiprocessor platforms. By splitting some tasks between processors, semi-partitioned scheduling is used to improve processor utilization. In this paper, a new semi-partitioned scheduling algorithm called SS-DRM is proposed for multiprocessor platforms. The scheduling policy used in SS-DRM is based on the delayed rate monotonic algorithm, which is a modified version of the rate monotonic algorithm that can achieve higher processor utilization. This algorithm can safely schedule any system composed of two tasks with total utilization less than or equal to that on a single processor. First, it is formally proven that any task which is feasible under the rate monotonic algorithm will be feasible under the delayed rate monotonic algorithm as well. Then, the existing allocation method is extended to the delayed rate monotonic algorithm. After that, two improvements are proposed to achieve more processor utilization with the SS-DRM algorithm than with the rate monotonic algorithm. According to the simulation results, SS-DRM improves the scheduling performance compared with previous work in terms of processor utilization, the number of required processors, and the number of created subtasks.
Addressing User Requirements in Open Source Software: The Role of Online Forums
Raza, Arif ; Capretz, Luiz Fernando ;
Journal of Computing Science and Engineering, volume 8, issue 1, 2014, Pages 57~63
DOI : 10.5626/JCSE.2014.8.1.57
User satisfaction has always been important in the success of software, regardless of whether it is closed and proprietary or open source software (OSS). OSS users are geographically distributed and include technical as well as novice users. However, it is generally believed that if OSS was more usable, its popularity would increase tremendously. Hence, users and their requirements need to be addressed in the priorities of an OSS environment. Online public forums are a major medium of communication for the OSS community. The research model of this work studies the relationship between user requirements in open source software and online public forums. To conduct this research, we used a dataset consisting of 100 open source software projects in different categories. The results show that online forums play a significant role in identifying user requirements and addressing their requests in open source software.