• Journal of Internet Computing and Services
• /
• v.8 no.2
• /
• pp.23-31
• /
• 2007

If the effort(manpower) and schedule are estimated, there is very difficult to allocate the manpower according to the schedule time units efficiently. Generally, the Putnam's Rayleigh Model has been applied popularly. This distribution model is expressing topology that manpower is consumed concentrically in first-half point. But actual manpower of projects are consumed concentrically at middle or second half point. Therefore, this model cannot be applied in software project planning area. This paper suggests a model to distribute manpower efficiently. Fist of all, we investigate a typical type presenting in software development field and manpower profile type of actuality development projects. Next, we suggested a method to present the model by a drawing a contour about manpower profile for the efficient manpower distribution. The proposed model shows better performance than Rayleigh and Gomma model. By applying proposed model, we will properly distribute manpower to schedule in software development planning phase, and finally we may manage project successfully.

• Journal of the Korea Society for Simulation
• /
• v.18 no.2
• /
• pp.29-38
• /
• 2009

In the computing environment with heterogeneous resources, a job scheduling model is necessary for effective resource utilization and high-speed data processing. And, the job scheduling model has to cope with a dynamic change in the condition of resources. There have been lots of researches on resource estimation methods and heuristic algorithms about how to distribute and allocate jobs to heterogeneous resources. But, existing researches have a weakness for system compatibility and scalability because they do not support the standard language. Also, they are impossible to process jobs effectively and deal with a variety of computing situations in which the condition of resources is dynamically changed in real-time. In order to solve the problems of existing researches, this paper proposes a semantic computing-based dynamic job scheduling model that defines various knowledge-based rules for job scheduling methods adaptable to changes in resource condition and allocate a job to the best suited resource through inference. This paper also constructs a resource ontology to manage information about heterogeneous resources without difficulty as using the OWL, the standard ontology language established by W3C. Experimental results shows that the proposed scheduling model outperforms existing scheduling models, in terms of throughput, job loss, and turn around time.

• Journal of the Korea Computer Graphics Society
• /
• v.21 no.3
• /
• pp.36-45
• /
• 2015

It is important subject of research in engineering and natural science field that creating continuing high-definition image from very large volume data. The necessity of software that helps analyze useful information in data has improved by effectively showing visual image information of high resolution data with visualization technique. In this paper, we designed multi-platform visualization system based on client-server to analyze and express earth environment data effectively constructed with observation and prediction. The visualization server comprised of cluster transfers data to clients through parallel/distributed computing, and the client is developed to be operated in various platform and visualize data. In addition, we aim user-friendly program through multi-touch, sensor and have made realistic simulation image with image-based lighting technique.

• Journal of the Korea Convergence Society
• /
• v.10 no.12
• /
• pp.71-80
• /
• 2019

DevOps is a combining which means giving a diverse environments for software development and operations through whole software lifecycle. The key value of the proposed DevOps platform is the fast and stable service capability for a software development and operation environment. To do this, the DevOps gives pre-embedded 7 programming languages-Java, C/C++, Python, PHP, Ruby, Node.js, goLang and 7 service frameworks - Korea eGov Framework, Spring, Struts, Django, Laravel, Rails, Express. With the DevOps platform, it is possible to develop a software and also to build and distribute operation packages directly with the Linux containers. In this paper, the performance evaluation for a compile time, a distribution time and a processing capability is will be also proved. Though the performance evaluation, this paper shows capabilities of the proposed DevOps for Cloud services with commercial service level, prospectively.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.7 no.1
• /
• pp.51-61
• /
• 2011

A smartphone is a mobile phone that offers more advanced computing ability and connectivity than a contemporary basic feature phone. Unlike feature phone, a smartphone allows the user to install and run more advanced applications based on a specific platform. Smartphones run complete operating system software providing a platform for application developers. A smartphone will become the default computing method for many point activities in the not-too-distant future, such as e-mail, online shopping, gaming, and even video entertainment. For smartphone that contains sensitive information and access the Internet, security is a major issue. In the 1980s, security issues were hardly noticed; however, security is a major issue for users today, which includes smart phones. Because security is much more difficult to address once deployment and implementation are underway, it should be considered from the beginning. Recently our government recognized the importance of smartphone security and published several safety tips for using the smartphone. However, theses tips are user-oriented measures. Maintaining the security of a smartphone involves the active participation of the user. Although it is a important users understand and take full advantage of the facilities afforded by smarphone, it is more important developers distribute the secure smartphone application through the market. In this paper we describe some scenarios in which user is invaded his/her privacy by smartphone stolen, lost, misplaced or infected with virus. Then we suggest the security considerations for securing smartphone applications in respect with developers. We also suggest the methods applying domestic encryption algorithms such as SEED, HIGHT and ARIA in developing secure applications. This suggested security considerations may be used by developers as well as users (especially organizations) interested in enhancing security to related security incidents for current and future use of smartphones.

• Smart Media Journal
• /
• v.8 no.4
• /
• pp.46-52
• /
• 2019

The size of data generated and collected at industrial sites or in public institutions is growing rapidly. The existing data processing server often handles the increasing data by increasing the performance by scaling up. However, in the big data era, when the speed of data generation is exploding, there is a limit to data processing with a conventional server. To overcome such limitations, a distributed cluster computing system has been introduced that distributes data in a scale-out manner. However, because distributed cluster computing systems distribute data, inefficient use of network bandwidth can degrade the performance of the cluster as a whole. In this paper, we propose a scheme that compresses data when transmitting data in a Hadoop cluster considering network bandwidth. The proposed scheme considers the network bandwidth and the characteristics of the compression algorithm and selects the optimal compression transmission scheme before transmission. Experimental results show that the proposed scheme reduces data transfer time and size.

• The KIPS Transactions:PartD
• /
• v.10D no.2
• /
• pp.175-186
• /
• 2003

Mobile clients like a PDA need a cache and a spatial index to search and access map data efficiently. When a server transmits spatial objects to a mobile client which has a low storage capacity, some of them can be duplicated in a cache of the mobile client. Moreover, the cost for strong added data in the cache and reconfiguring spatial index is very high in the mobile client with low computing power. The scheme for processing duplicated objects and disturbing tasks of the mobile client which has low computing power is needed. In this paper, we classfy the method for strorng duplicated objects and present the scheme for the both caching objects and reconfiguring a spatial index of cached objects using the clipping technique. We propose the caching system based on an agent in order to distribute the overhead of a mobile client as well as to provide efficiently map services. We design and implement it, and evaluate the performance.

• Journal of KIISE:Information Networking
• /
• v.30 no.3
• /
• pp.293-306
• /
• 2003

In recent years, distributed computing environments have been radically changing to a structure of global, heterogeneous, federative and wide-area systems. This structure's environments consist of a let of objects which are implemented on telecommunication network to provide a wide range of services. Furthermore, all of objects existing on the earth have the duplicated characteristics according to how to categorize their own names or properties. But, the existing naming or trading mechanism has not supported the binding services of duplicated objects, because of deficiency of independent location service. Also, if the duplicated objects which is existing on different nodes provide the same service, it is possible to distribute the client requests considering each system's load. For this reason, we designed and implemented a new model that can not only support the location management of replication objects, but also provide the dynamic binding service of objects located in a system with minimum overload for maintaining load balancing among nodes in wide-area object computing environments. Our model is functionally divided into two parts; one part is to obtain an unique object handle of replicated objects with same property as a naming and trading service, and the other is to search one or more contact addresses by a location service using a given object handle. From a given model mentioned above, we present the procedures for the integrated binding mechanism in design phase, that is, Naming/Trading Service and Location Service. And then, we described in details the architecture of components for Integrated Binding Service implemented. Finally, we showed our implement environment and executing result of our model.

• Journal of KIISE:Computing Practices and Letters
• /
• v.12 no.2
• /
• pp.111-118
• /
• 2006

In this thesis, we analyze the efficiency of the algorithm to distribute the load in the clustered system, by comparing with the existed algorithm. PWLC algorithm detects each server's load in the system at weighted period, and following the detection of the loads, a set of weights is given to each server. The system allocates new loads to each server according to its weight. PWLC algorithm is compared with DWRR algorithm in terms of variance, waiting time by varying weighted Period. When the weighted period is too short, the system bears a heavy load for detecting load over time. On the other hand, when the weighted period is too long, the load balancing control of the system becomes ineffective. The analysis shows PWLC algorithm is more efficient than DWRR algorithm for the variance and waiting time.

• IEIE Transactions on Smart Processing and Computing
• /
• v.5 no.3
• /
• pp.169-177
• /
• 2016

To realize high-speed intrusion detection by accommodating many regular expression (regex)-based signatures and growing network link capacities, we propose the Service TimE-Aware Load-balancing (STEAL) algorithm. This work is motivated from the observation that utilization of a many-core network intrusion detection system (NIDS) is influenced by unfair computational distribution among many-core NIDS nodes. To avoid such unfair computational distribution, STEAL is designed to dynamically distribute a large volume of traffic among many-core NIDS nodes based on packet service time, which is represented by the deep packet time in many-core NIDS nodes. From experiments, we show that compared to the commonly used load-balancing algorithm based on arrival rate, STEAL increases the number of received packets (i.e., decreases the number of dropped packets) in many-core NIDS. Specifically, by integrating an open source NIDS (i.e. Bro) with STEAL, we show that even under attack-dominant traffic and with many signatures, STEAL can rapidly improve the performance of many-core NIDS to realize high-speed intrusion detection.