• Journal of Astronomy and Space Sciences
• /
• v.24 no.3
• /
• pp.197-202
• /
• 2007

We present infrared color-color diagrams of AGB stars from the observations at near and mid infrared bands. We compile the observations for hundreds of OH/IR stars and carbon stars using the data from the Midcourse Space Experiment (MSX), the two micron sky survey (2MASS), and the IRAS point source catalog (PSC). We compare the observations with the theoretical evolutionary tracks of AGB stars. From the new observational data base and the theoretical evolution tracks, we discuss the meaning of the infrared color-color diagrams at different wavelengths.

• Journal of Information Technology Services
• /
• v.6 no.2
• /
• pp.145-152
• /
• 2007

This paper describes an extension of Kaffe JVM which enables to extract runtime characteristics of a Java program. The runtime characteristics include frequency of method call instruction, ratio of library method call and ratio of method whose runtime is less than compile time. It also represents ratio of method called only once, polymorphicity of virtual call and distribution of method size called in runtime. This paper analyses runtime features of the SciMark benchmark suite using the extended Kaffe.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.3
• /
• pp.119-124
• /
• 2009

In this paper, AMR-WB+ audio coder is implemented, in real-time, using Intel 400MHz Xscale PXA250 with 32bit RISC processor ARM9E-J(R)core. The assembly code for ARM9E-J(R)core is developed through the serial process of C code optimization, cross compile, assembly code manual optimization and adjusting the optimized code to Embedded Visual C++ platform. C code is trimmed on Visual C++ platform. Cross compile and assembly code manual optimization are performed on CodeWarrior with ARM compiler. Through these stages the code for both ARM EVM board and PDA is implemented. The average complexities of the code are 160.75MHz on encoder and 33.05MHz on decoder. In case of static link library(SLL), the required memories are 65.21Kbyte, 32.01Kbyte and 279.81Kbyte on encoder, decoder and common sources, respectively. The implemented coder is evaluated using 16 test vectors given by 3GPP to verify the bit-exactness of the coder.

• Journal of KIISE:Software and Applications
• /
• v.27 no.5
• /
• pp.575-582
• /
• 2000

Because FIFO thread scheduling used in the existing multithreaded models does not consider locality in programs, it may result in the decrease of the performance of execution, caused by the frequent context switching overhead and delay of execution of relatively short frames. Quantum unit scheduling enhances the performance a little, but it still has the problems such as the decrease in the processor utilization and the longer delay due to its heavy dependency on the priority of the quantum units. In this paper, we propose shortest-frame-first(SFF) thread scheduling algorithm. Our algorithm selects and schedules the frame that is expected to take the shortest execution time using thread size and synchronization information analyzed at compile-time. We can estimate the relative execution time of each frame at compile-time. Using SFF thread scheduling algorithm on the multithreaded models, we can expect the faster execution, better utilization of the processor, increased throughput and short waiting time compared to FIFO scheduling.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.289-293
• /
• 2000

We propose two new algorithms for parallelism-independent scheduling. The machine code generated from the compiler using these algorithms in its scheduling phase is parallelism-independent code, executable in minimum time regardless of the number of the processors in the parallel computer. Our new algorithms have the following phases: finding the minimum number of processors on which the program can be executed in minimal time, scheduling by an heuristic algorithm for this predefined number of processors, and serialization of the parallel schedule according to the earliest start time of the tasks. At run time tasks are taken from the serialized schedule and assigned to the processor which allows the earliest start time of the task. The order of the tasks decided at compile time is not changed at run time regardless of the number of the available processors which means there is no out-of-order issue and execution. The scheduling is done predominantly at compile time and dynamic scheduling is minimized and diminished to allocation of the tasks to the processors. We evaluate the proposed algorithms by comparing them in terms of schedule length to the CP/MISF algorithm. For performance evaluation we use both randomly generated DAGs (directed acyclic graphs) and DACs representing real applications. From practical point of view, the algorithms we propose can be successfully used for scheduling programs for in-order superscalar processors and shared memory multiprocessor systems. Superscalar processors with any number of functional units can execute the parallelism-independent code in minimum time without necessity for dynamic scheduling and out-of-order issue hardware. This means that the use of our algorithms will lead to reducing the complexity of the hardware of the processors and the run-time overhead related to the dynamic scheduling.

• Lingua Humanitatis
• /
• v.7
• /
• pp.157-203
• /
• 2005

The Epic of Gilgamesh drew heavily upon Mesopotamian literary tradition. Sin-leqe-uninni, the editor of Standard Version of the Epic of Gilgamesh in 13th century B.C.E. adopted the Old Babylonian version as well as older Sumerian tales about Gilgamesh. He also was very successful by extensive use of materials and literary forms originally unrelated to Gilgamesh. The epic opens with a standard type of hymnic-epic prologue. This study lens a measure of vindication to the theoretical approach by which Morris Jastrow recognized the diversity of the sources, which underlies the epic and succeeded in identifying some of them. Thanks to the ample documentation available for the literary development of the epic, we can trace the steps which its author and editors took with the result that the epic inspires fears and aspirations for more than three thousand years.

• Communications of the Korean Institute of Information Scientists and Engineers
• /
• v.4 no.2
• /
• pp.65-73
• /
• 1986

The PM language is a Compiler writing language which syntax- directly translates a high level language into a intermediate language of matrix form. The PM assembler translates the PM language into recursive subroutines which test input strings or output intermediate terms or call another subroutines. A large subset of PASCAL compiler was written in the PM language.

• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06a
• /
• pp.268-270
• /
• 2012

동적 코드 분석 도구는 동적 컴파일(Just-in-Time Compile)을 통한 코드 변환 기술을 이용하여 응용프로그램 실행 중 기계어 수준의 코드를 분석한다. 기존의 동적 코드 분석 도구는 변환과정에서의 부하가 크기 때문에 리얼타임 프로그램에 적용하기 어렵다. 본 논문에서는 기존 동적 코드 분석 도구의 동적 컴파일 기법과 컴파일 프레임워크인 LLVM의 동적 컴파일 기법의 성능을 비교, 분석하였다. 이를 통해 LLVM의 동적 컴파일 기법을 이용한 높은 수행 성능을 가진 동적 코드 분석 도구의 설계 방안을 모색한다.

• Proceedings of the IEEK Conference
• /
• 2004.08c
• /
• pp.690-692
• /
• 2004

This paper describes Web based education technique. We implemented a remote compile system with 8051 micro controller. It implemented the system in this paper so that a learner compiled 8051 control programs to the remote. Most big restriction subject is the control of the hardware in an engineering field even though it implements a remote education system. We download the Java Application to Java Web Start and execute in this system. In this paper the learner controls 8051 executions in Web to the remote and implemented so that we confirmed the action. The supplementary problem will be the construction of a remote education system which offeres existing text and sound information, flash animation.

• Journal of the Korea Computer Industry Society
• /
• v.6 no.2
• /
• pp.365-372
• /
• 2005

Generally, In a application program the core part for parallel processing is a loop. therefore exist data dependencies between the array index variables of a loop. The data dependence relations between statements which from variable or constant dependence distance are specially complex. Therefore extracting parallelism for those statements at compile time is very difficult. in this paper, among the proposed methods of extracting parallelism, analysis the unimodular method and non-unimodular method and grasping the merits and demerits of them. hereafter, this method will go far toward solving the effectively extracting parallelism of the loop.