• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.1
• /
• pp.39-60
• /
• 2017

In the Cloud, for the scheduling of parallel jobs, there are many tasks in a job and those tasks are executed concurrently on different VMs (Visual machines), where each task of the job will be executed synchronously. The goal of scheduling is to reduce the execution time and to keep the fairness between jobs to prevent some jobs from waiting more time than others. We propose a Cloud model which has multiple Clouds, and under this model, jobs are in different lists according to the waiting time of the jobs and every job has different parallelism. At the same time, a new method-ZOMT (the scheduling parallel tasks based on ZERO-ONE scheduling with multiple targets) is proposed to solve the problem of scheduling parallel jobs in the Cloud. Simulations of ZOMT, AFCFS (Adapted First Come First Served), LJFS (Largest Job First Served) and Fair are executed to test the performance of those methods. Metrics about the waiting time, and response time are used to test the performance of ZOMT. The simulation results have shown that ZOMT not only reduces waiting time and response time, but also provides fairness to jobs.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2001.01a
• /
• pp.78-82
• /
• 2001

Most of current Internet auction systems are simple server programs that partly automated the function of the conventional auction house. These system do not provide sufficient independence, distribution and parallelism between the functions of the conventional auction house. In there are automated by server program, but still users need to execute a repetitive task to monitor the dynamic progress of a certain auction, decide proper bid price, and submit the bid. Another problem is that they support only single as English auction and Dutch auction, but they do not support the double auctions are superior to the single auction with respect to speed., efficiency, and the fair distribution of profit. In this paper, we present design and implement of an agent-based continuous double auction system, called CoDABot, in order to mitigate the limitations of current auctions system. CoDABot supports continuous double auction, provides various bidding agent for users to select, and has been implemented into a multi-agent system that realize more independent, distributed, and parallel subsystems.

• The Journal of Society for e-Business Studies
• /
• v.2 no.1
• /
• pp.21-37
• /
• 1997

As the complexity in design and manufacturing activities of distributed virtual enterprises rapidly increases, the issue of process management becomes more critical to shorten the time-to-market, reduce the manufacturing cost and improve the product quality. This paper proposes a unified framework to manage design and manufacturing processes in a distributed environment. We present a methodology which utilizes process flow graphs to depict the hierarchical structure of workflows and process grammars to represent various design processes and design tools. To implement the proposed concept, we develop a process management system which mainly consists of a cockpit and manager programs, and we finally address a preliminary implementation procedure based on the Object Modeling Technique. Since the proposed framework can be a formal approach to the process management by providing formalism, parallelism, reusability, and flexibility, it can be effectively applied to further application domains of distributed virtual enterprises.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.12
• /
• pp.2132-2139
• /
• 2006

A parallel program including a nested parallelism has a complex execution aspects and tasks are executed concurrently. This concurrency is a main cause raising most of errors. In this paper, a new method for checking concurrency between two tasks is proposed. The existing techniques for checking the concurrency have their limits to represent a global structure. A new labeling technique that appropriate for image visualization is proposed. To show the global structure by imaging of execution aspects through region partition on 2D plane. On the basis of it, each of the tasks that can distinguish the ordered relation create an independent image. Image information generated by the result simplifies semantic analysis of the related task, and provides an outline of a global execution aspects structure of the program to user effectively.

• Smart Media Journal
• /
• v.4 no.4
• /
• pp.56-63
• /
• 2015

Modern GPU can execute mass parallel computation by exploiting many GPU core. GPGPU architecture, which is one of approaches exploiting outstanding computational resources on GPU, executes general-purpose applications as well as graphics applications, effectively. In this paper, we investigate the impact of memory-efficiency and performance according to number of CTAs(Cooperative Thread Array) on a SM(Streaming Multiprocessors), since the analysis of relation between number of CTA on a SM and them provides inspiration for researchers who study the GPU to improve the performance. Our simulation results show that almost benchmarks increasing the number of CTAs on a SM improve the performance. On the other hand, some benchmarks cannot provide performance improvement. This is because the number of CTAs generated from same kernel is a little or the number of CTAs executed simultaneously is not enough. To precisely classify the analysis of performance according to number of CTA on a SM, we also analyze the relations between performance and memory stall, dram stall due to the interconnect congestion, pipeline stall at the memory stage. We expect that our analysis results help the study to improve the parallelism and memory-efficiency on GPGPU architecture.

• The KIPS Transactions:PartB
• /
• v.10B no.5
• /
• pp.515-520
• /
• 2003

This paper proposes a calibration method from two images. Camera calibration is necessarily required to obtain 3D Information from 2D images. Previous works to accomplish the camera calibration needed the calibration object or required more than three images to calculate the Kruppa equation, however, we use the geometric constraints of parallelism and orthogonality can be easily presented in man-made scenes. The task of it is to obtain intrinsic and extrinsic camera parameters. The intrinsic parameters are evaluated from vanishing points and then the extrinsic parameters which are consisted of rotation matrix and translation vector of the camera are estimated from corresponding points of two views. From the calibrated parameters, we can recover the projection matrices for each view point. These projection matrices are used to recover 3D information of the scene and can be used to visualize new viewpoints.

• The KIPS Transactions:PartA
• /
• v.11A no.5
• /
• pp.303-312
• /
• 2004

In this paper, we propose a methodology solving the problem of the hardware-software partitioning in reconfigurable systems using a Y-chart design space exploration and implement a simulator according to the methodology. The methodology generates a mapping set between tasks and hardware elements using the hardware element model and the application model. We evaluate the throughput by simulating cases in each mapping set. With the throughput evaluation result, we can select the mapping case with the highest throughput. We also propose an heuristic improving the simulation time by reducing the mapping set on the basis of the relationship between workload and parallelism. Simulation results show that we can reduce the size of mapping set which poses difficulties on hardware-software partitioning by up to 80%.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.9
• /
• pp.1-8
• /
• 2010

The key challenge in HW/SW co-design is how to choose the appropriate HW/SW partitioning from the vast array of possible options in the mapping set. In this paper we present a unique and efficient approach for addressing this problem known as Customized Heuristic Algorithm for Reducing Mapping Sets(CHARMS). CHARMS uses sensitivity to individual task computational complexity as well the computed weighted values of system performance influencing metrics to streamline the mapping sets and extract the most optimal cases. Using H.263 encoder, we show that CHARMS sieves out 95.17% of the sub-optimal mapping sets, leaving the designer with 4.83% of the best cases to select from for run-time implementation.

• Journal of KIISE:Computing Practices and Letters
• /
• v.7 no.6
• /
• pp.641-652
• /
• 2001

Most of current internet auction systems are single auction server program that partly automates the function of the conventional auction house. So these systems do not provide sufficient independence, distribution and parallelism between the functions of the conventional auction house. In these suction systems, only some of suction management facilities are automated by the server program, but still users need to execute a repetitive task to monitor the dynamic progress of a certain auction, decide the proper bid price, and submit the bid. Another problem is that they support only the single auctions such as English suction and Dutch auction, but they do not support the double auctions that are superior to the single auction in terms of speed, efficiency, and the fair distribution of profit. In this paper, we present are design and implement of an agent-based continuous double auction system, called CoDABot, in order to overcome the limitations of current auction systems. CoDABot supports the continuous double auction, provides various bidding agents for users to select, and has been implemented with a multi-agent system to realize more independent, and parallel subsystems.

• Journal of Intelligence and Information Systems
• /
• v.8 no.2
• /
• pp.205-227
• /
• 2002

Our study is focused on a multiple-agent system to provide efficient collaborative work by automating the conference calling process with the help of intelligent agents. Automating the meeting scheduling requires a careful consideration of the individual official schedule as well as the privacy and personal preferences. Therefore, the automation of conference calling needs the distributed processing task where a separate calendar management process is associated for increasing the reliability and inherent parallelism. This paper describes in detail the design and implementation issues of a multiple-agent system for conference calling that allows the convener and participants to minimize their efforts in creating a meeting. Our system is based on the client-sewer model. In the sewer side, a scheduling agent, a negotiating agent, a personal information managing agent, a group information managing agent, a session managing agent, and a coordinating agent are operating. In the client side, an interface agent, a media agent, and a collaborating agent are operating. Agents use a standardized knowledge manipulation language to communicate amongst themselves. Communicating through a standardized knowledge manipulation language allows the system to overcome heterogeneity which is one of the most important problems in communication among agents for distributed collaborative computing. The agents of our system propose the dates on which as many participants as possible are available to attend the conference using the forward chaining algorithm and the back propagation network algorithm.