• Journal of the Society of Naval Architects of Korea
• /
• v.42 no.4 s.142
• /
• pp.411-420
• /
• 2005

World leading company and research centers have invested much cost and effort into a PLM and digital manufacturing field to obtain their own competitiveness. We have been trying to apply a digital manufacturing, especially simulation to ship production process as a part of PLM implementation for a shipyard. A shipbuilding production system and processes have a complexity and a peculiarity different from other kinds of production systems. So, new analysis and modeling methodology is required to implement digital shipyard. which is a digital manufacturing system for a shipbuilding company. This paper suggests an analysis and simulation modeling methodologies for an implementation of a digital shipyard. New methodologies such as a database-merged simulation, a distributed simulation, a modular simulation with a model library and a 3-tire simulation framework are developed.

• Journal of Communications and Networks
• /
• v.10 no.3
• /
• pp.258-267
• /
• 2008

In this paper, we examine what changes the next-generation wireless communication systems will experience in terms of the technologies, services, and networks and, based on that, we investigate how the inter-cell interference management should evolve in various aspects. We identify that the main driving forces of the future changes involve the data-centric services, new dynamic service scenarios, all-IP core access networks, new physical-layer technologies, and heavy upload traffic. We establish that in order to cope with the changes, the next-generation inter-cell interference management should evolve to 1) set the objective of providing a maximal data rate, 2) take the form of joint management of power allocation and user scheduling, 3) operate in a fully distributed manner, 4) handle the time-varying channel conditions in mobile environment, 5) deal with the changes in interference mechanism triggered by the new physical-layer technologies, and 6) increase the spectral efficiency while avoiding centralized coordination of resource allocation of the users in the uplink channel.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.6A
• /
• pp.803-819
• /
• 1999

We introduces a wireless multimedia CDMA system configuring multiple transmission links between a user and radio ports. We propose a centralized reservation access control scheme with transmission scheduling and dynamic allocation (CRMA/TSDA) to support the diverse multimedia traffic in the introduced CDMA system. We propose two types of transmission allocation algorithms: slot and link allocation algorithms with local information and global information. The transmission allocation algorithm proposed in this paper allocates a set of ports configuring multiple radio links and transmission slot/power to each of scheduled transmission requests. We perform simulations for the proposed system and algorithms. Through the simulation, we show that the performance of the algorithm with local information stands comparison with that of the quasi-optimum algorithm with global information. Also, the two algorithms in the system has shown to have better performance than the conventional CDMA system with a distributed random transmission method.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.33 no.3
• /
• pp.169-175
• /
• 2010

Recently, to improve operating efficiency with the higher in-line rate in automated production lines, a lot of cases of grouping machines and material handling system together to form a cluster has shown frequently. This article addresses the job allocation and operation method of automated material handling for cluster-type production systems. First of all, the control problems of the automated material handling systems are classified into the control problem of inter-cluster material handling system and that of intra-cluster material handling system. Then, a distributed agent-based control scheme is proposed for the former, and an operational control procedure for the latter. Simulation experiment shows that the proposed method is efficient in reducing cycle times and improving utilization of material handling vehicles.

• Journal of the Korea Society of Computer and Information
• /
• v.1 no.1
• /
• pp.147-158
• /
• 1996

This paper proposed a concurrency control structure based on specialized data flow graphs that was analysed a run-time concurrency control activity to be integrated with the task scheduler Data were viewed as flowing on the arcs from one node to another in a stream of discrete to tokens. The network that Is based upon the Entity-Relationship model, can be viewed a fixed problems used query tokens as a data flow graph. The performance was measured used in the various expriments compared the overall performance of the different concurrency control methods, DBFG (DataBase Flow graphs) scheduling had the knowledge to obtain better performance than 2PL in a distributed environment.

• Journal of Information Processing Systems
• /
• v.8 no.4
• /
• pp.555-566
• /
• 2012

The cloud environment makes it possible to analyze large data sets in a scalable computing infrastructure. In the bioinformatics field, the applications are composed of the complex workflow tasks, which require huge data storage as well as a computing-intensive parallel workload. Many approaches have been introduced in distributed solutions. However, they focus on static resource provisioning with a batch-processing scheme in a local computing farm and data storage. In the case of a large-scale workflow system, it is inevitable and valuable to outsource the entire or a part of their tasks to public clouds for reducing resource costs. The problems, however, occurred at the transfer time for huge dataset as well as there being an unbalanced completion time of different problem sizes. In this paper, we propose an adaptive resource-provisioning scheme that includes run-time data distribution and collection services for hiding the data transfer time. The proposed adaptive resource-provisioning scheme optimizes the allocation ratio of computing elements to the different datasets in order to minimize the total makespan under resource constraints. We conducted the experiments with a well-known sequence alignment algorithm and the results showed that the proposed scheme is efficient for the cloud environment.

• Journal of Information Processing Systems
• /
• v.6 no.4
• /
• pp.553-562
• /
• 2010

The core services in cloud computing environment are SaaS (Software as a Service), Paas (Platform as a Service) and IaaS (Infrastructure as a Service). Among these three core services server virtualization belongs to IaaS and is a service technology to reduce the server maintenance expenses. Normally, the primary purpose of sever virtualization is building and maintaining a new well functioning server rather than using several existing servers, and in improving the various system performances. Often times this presents an issue in that there might be a need to increase expenses in order to build a new server. This study intends to use grid service architecture for a form of server virtualization which utilizes the existing servers rather than introducing a new server. More specifically, the proposed system is to enhance system performance and to reduce the corresponding expenses, by adopting a scheduling algorithm among the distributed servers and the constituents for grid computing thereby supporting the server virtualization service. Furthermore, the proposed server virtualization system will minimize power management by adopting the sleep severs, the subsidized servers and the grid infrastructure. The power maintenance expenses for the sleep servers will be lowered by utilizing the ACPI (Advanced Configuration & Power Interface) standards with the purpose of overcoming the limits of server performance.

• Journal of Information Processing Systems
• /
• v.13 no.5
• /
• pp.1299-1319
• /
• 2017

This paper presents a scalable multiple camera collaboration strategy for active tracking applications in large areas. The proposed approach is based on distributed mechanism but emulates the master-slave mechanism. The master and slave cameras are not designated but adaptively determined depending on the object dynamic and density distribution. Moreover, the number of cameras emulating the master is not fixed. The collaboration among the cameras utilizes global and local sectors in which the visual correspondences among different cameras are determined. The proposed method combines the local information to construct the global information for emulating the master-slave operations. Based on the global information, the load balancing of active tracking operations is performed to maximize active tracking coverage of the highly dynamic objects. The dynamics of all objects visible in the local camera views are estimated for effective coverage scheduling of the cameras. The active tracking synchronization timing information is chosen to maximize the overall monitoring time for general surveillance operations while minimizing the active tracking miss. The real-time simulation result demonstrates the effectiveness of the proposed method.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.04a
• /
• pp.101-104
• /
• 2001

데이터베이스에서 트랜잭션의 처리량을 향상시키기 위해서 기존의 문법 위주의 직렬성 이론으로는 단위시간당 처리량을 높이기는 힘든 형편이다. 이를 위하여 이타적 잠금 기법(altruistic locking: AL)은 트랜잭션이 객체를 사용한 다음 더 이상 그 객체를 요구하지 않을 때 다른 트랜잭션들이 그 객체를 로크할 수 있도록 미리 객체에 대한 로크를 해제함으로써 트랜잭션들의 대기시간을 줄이고 처리량을 향상시키기 위한 취지에서 제안된 것이다. 확장형 이타적 잠금(extended altruistic locking: XAL)기법은 AL 을 자취의 확장한 것으로 AL 이 근본적으로 안고 있는 반드시 기부된 객체만을 처리해야 한다는 제약을 완화한 기법이다. 본 논문에서는 분산 데이터베이스 환경하에서 장기 트랜잭션으로 인한 단기 트랜잭션의 대기현상을 최소화하도록 함으로써 동시성 제어의 정도를 높일 수 있는 새로운 확장형 이타적 잠금 기법인 양방향 기부기법(two-way donation locking: 2DL)을 제안하고 기존의 제어기법과 비교하였다. 모의실험에 의한 성능평가 결과 2DL 은 작업 처리율과 트랜잭션의 평균 대기시간 면에서 우수한 결과를 나타내었다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.8
• /
• pp.3880-3899
• /
• 2019

Distributive desynchronization algorithms based on pulse-coupled oscillator (PCO) models have been proposed for achieving collision-free wireless transmissions. These algorithms do not depend on a global clock or infrastructure overheads. Moreover, they gradually converge to fair time-division multiple access (TDMA) scheduling by broadcasting a periodic pulse signal (called a 'firing') and adjusting the next firing time based on firings from other nodes. The time required to achieve constant spacing between phase neighbors is estimated in a closed form or via stochastic modeling. However, because these algorithms cannot guarantee the completion of desynchronization in a short and bounded timeframe, they are not practical. Motivated by the limitations of these methods, we propose a practical solution called PD-DESYNC that provides a short and deterministic convergence time using a flag firing to indicate the beginning of a cycle. We demonstrate that the proposed method guarantees the completion of desynchronization within three cycles, regardless of the number of nodes. Through extensive simulations and experiments, we confirm that PD-DESYNC not only outperforms other algorithms in terms of convergence time but also is a practical solution.