• Journal of KIISE:Software and Applications
• /
• v.34 no.5
• /
• pp.487-501
• /
• 2007

To achieve high resource utilization for multi-issue DSPs, production compiler commonly includes variants of iterative modulo scheduling algorithm. However, excessive cyclic data dependences, which exist in communication and media processing loops, unduly restrict modulo scheduling freedom. As a result, replicated functional units in multi-issue DSPs are often under-utilized. To address this resource under-utilization problem, our paper describes a novel compiler preprocessing strategy for effective modulo scheduling. The preprocessing strategy proposed capitalizes on two new transformations, which are referred to as cloning and dismantling. Our preprocessing strategy has been validated by an implementation for StarCore SC140 DSP compiler.

• Journal of Radiation Protection and Research
• /
• v.12 no.1
• /
• pp.12-25
• /
• 1987

A basic multichannel analyser (MCA) system have been designed and constructed with the successive approximation type ADC (Analog to Digital Converter). Linear Gate, window, and palse stretcher consist of mainly linear and logic IC's, and are properly combined together to achieve short dead time and good linearity of the system. ADC 1211 (analysing time: $120{\mu}sec$) and S-RAM (static random acess memory) 6264 are used in ADC module. Two 6264 memories are connected in parallel in order to-provide enough counting capacity ($2^{16}-1$). Interfaced microcomputer Apple II controls this system and analizes the counted data. The system is tested by input pulses between 0V to 10V from oscillator.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.3
• /
• pp.433-442
• /
• 1995

This paper presents an improved VLSI implementation of a parallel sorter to achieve O(Ν) time complexity. Many fast VLSI sort algorithms have been proposed for sorting N elements in O(log Ν) time. However, most such algorithms proposed have complex network structure without considering data input and output time. They are also very difficult to expand or to use in real applications. After analyzing the chip area and time complexity of several parallel sort algorithms with overlapping data input and output time, the most effective algorithm, the rebound sort algorithm, is implemented in VLSI with some improvements. To achieve O(Ν) time complexity, an improved rebound sorter is able to sort 8 16-bits records on a chip. And it is possible to sort more than 8 records by connecting chips in a chain vertically.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.5
• /
• pp.787-796
• /
• 1995

In this paper, a mechanism to enhance the utilization of the tertiary storage devices such as optical disk, digital tape and so on is proposed. For this purpose, we suggest a storage structure with a CD-ROM and multiple disk and design an efficient mechanism to represent the continuous media stored in CD-ROM. The continuous media storage structure proposed in this pater can enhanced the retrieval capability of information by sending data using a shared bus with high bandwidth. And a continuous media representation mechanism not only can reduce the discontinuity of representation using parallel operation of fetch and representation but also minimize the variance of service time and the missing ratio of re-reference requirement by residing frequently accessed object on the disk.

• The Journal of the Acoustical Society of Korea
• /
• v.13 no.2
• /
• pp.38-49
• /
• 1994

This paper proposes Echo canceller used in simultaneous two-way ('full-duplex') transmission of data signals over two-wire circuits which can be achieved by using a hybrid coupler. This Echo canceller uses sequential processing instead of parallel processing with conventional adaptive digital filter. This structure reduces the number of multipliers. Thus, this structure is much more suitable for IC implementation. This Echo canceller operates according to the 'Stochastic Iteration Algorithm(SIA).' SIA algorithm has merit of good performance and small hardware requirement.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.7_8
• /
• pp.417-425
• /
• 2003

We propose an efficient one-time signature scheme for stream authentication by improving HORS. When one-time signatures are used for authenticating live streams, one of the most serious drawbacks is that its large signature size yields high communication overhead. Compared with the previous one-time signature schemes, proposed scheme has the smallest signature size. Moreover, verification overhead is very low. Compared with the previous schemes for stream authentication, signing overhead of our scheme is larger than that of HORS but much lower than those of BiBa or Powerball. Moreover, signing operation can be trivially parallelized without any additional risk because it does not require sharing of the secret key between distributed servers.

• Journal of KIISE:Computing Practices and Letters
• /
• v.5 no.2
• /
• pp.223-235
• /
• 1999

본 논문에서는 HDTV 데이터를 입출력할 수 있는 고속 실시간 데이터 저장 시스템을 제안한다. 이 시스템은 ⅰ) 방대한 크기를 HDTV 데이터를 고속으로 입출력할 수 있어야 한다. ⅱ)데이타를 연속적으로 입출력할 수 있는 것 외에 데이터를 비선형적으로 랜덤하게 억세스 할 수 있어야 한다. ⅲ)실시간으로 데이터를 재생하기 위해 일정하게 주어진 시스템 입출력 속도를 항상 만족할수 있어야 한다. 이러한 조건을 만족시키기 위해서 여러 개의 하드디스크를 병렬로 연결하고 데이터들을 각각의 하드디스크에 나누어 저장하였다. 하드디스크의 입출력 성능은 하드디스크 아암의 탐색 동작에 의해 크게 좌우되므로 탐색 동작을 효과적으로 제어할 수 있는 방법이 설계되었다. 제안된 시스템은 주제어부, 데이터 분배부, 종제어부로 나뉘며 각각의 하드디스크는 독립도니 종제어부에 의해 제어된다. 제안된 시스템이 주어진 요구사항을 만족하는지를 확인하기 위하여, 제안된 시스템을 DEVS 형식론을 이용하여 구현하고 시뮬레이션 하였다. DEVS 형식론은 이산사건 시스템을 계층적이고 모듈화된 형태로 기술한다. 시뮬레이션 과정에서 발생된 사건들을 분석하였다. 그 결과 제안된 시스템이 주어진 요구사항을 잘 만족함을 보았다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.9
• /
• pp.416-424
• /
• 2007

The Bio-Inspired system is a computing model that emulates the objects in ecosystem which are evolving themselves and cooperate each other to perform some tasks. Since it could be used to solved the complex problems that have been very difficult to resolve with previous algorithms, there have been a lot of researches to develop an application based on the Bio-Inspired system. However, since this computing model requires the process of evolving and cooperating with a lot of objects and this process takes a lot of times, it has been very hard to develop an application based on this computing model. This paper presents a parallel simulator for a Bio-Inspired system that is designed and implemented with OMNeT++ on PC clusters, and proves its usefulness by showing its simulation performance for a couple of applications. In the proposed parallel simulator, the functions required in the ERS platform for evolving and cooperating between objects (called Ecogent) are mapped onto the functions of OMNeT++, and they are simulated on PC clusters simultaneously to reduce the total simulation time. The simulation results could be monitored with a GUI In realtime, and they are also recorded into DBMS for systematic analyses afterward. This paper shows the usefulness of the proposed system by analyzing its performances for simulating various applications based on Bio-Inspired system on PC clusters with 4 PCs.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.7
• /
• pp.429-439
• /
• 2006

A desktop grid, which is a computing grid composed of idle computing resources in a large network of desktop computers, is a promising platform for compute-intensive distributed computing applications. However, due to reliability and unpredictability of computing resources, effective scheduling of parallel computing applications on such a platform is a difficult problem. This paper proposes a new scheduling method aimed at reducing the total execution time of a parallel application on a desktop grid. The proposed method is based on utilizing the histories of execution behavior of individual computing nodes in the scheduling algorithm. In order to test out the feasibility of this idea, execution trace data were collected from a set of 40 desktop workstations over a period of seven weeks. Then, based on this data, the execution of several representative parallel applications were simulated using trace-driven simulation. The simulation results showed that the proposed method improves the execution time of the target applications significantly when compared to previous desktop grid scheduling methods. In addition, there were fewer instances of application suspension and failure.

• Journal of KIISE:Computing Practices and Letters
• /
• v.6 no.2
• /
• pp.120-134
• /
• 2000

In this paper we present a Distributed Object oriented Virtual computing Environment, called DOVE which consists of autonomous distributed objects interacting with one another via method invocations based on a distributed object model. DOVE appears to a user logically as a single virtual computer for a set of heterogeneous hosts connected by a network as if objects in remote site reside in one virtual computer. By supporting efficient parallelism, heterogeneity, group communication, single global name service and fault-tolerance, it provides a transparent and easy-to-use programming environment for parallel applications. Efficient parallelism is supported by diverse remote method invocation, multiple method invocation for object group, multi-threaded architecture and synchronization schemes. Heterogeneity is achieved by automatic data arshalling and unmarshalling, and an easy-to-use and transparent programming environment is provided by stub and skeleton objects generated by DOVE IDL compiler, object life control and naming service of object manager. Autonomy of distributed objects, multi-layered architecture and decentralized approaches in hierarchical naming service and object management make DOVE more extensible and scalable. Also,fault tolerance is provided by fault detection in object using a timeout mechanism, and fault notification using asynchronous exception handling methods