• Journal of The Korean Association of Information Education
• /
• v.18 no.3
• /
• pp.371-380
• /
• 2014

There is a little curriculum for gifted and talented elementary information. Generally parallel curriculum model(PCM) for gifted children is being applied to many subjects. It is necessary to apply the PCM for gifted elementary children of information science. This model is a prime example of a training program was applied to the encryption. There are four parallel curriculum model. The four curriculum model can be used individually or combined, may be used only partially. In this study, the benefits of parallel curriculum model in order to reflect as much as possible in order all four courses were used. This program for 19 students in the gifted children for information science class were applied to four periods. Observe and record the activities of students in class, the survey targeted learners, assignments, methods of analysis were used. We found that the level of the program was suitable and the aspects of giftedness such as an ability to focus on the task and an ability to solve the problem were enhanced. Moreover, participants became more interested in the topic of encryption following the program.

• Journal of KSNVE
• /
• v.5 no.3
• /
• pp.337-344
• /
• 1995

A BEM program is developed for the performance analysis of axisymmetric mufflers. In the program the sub-region method is used to deal with singularity or inner boundary. The program is applied to typical axisymmjetric mufflers such as simple expansion, extended tube, perforated tube and absorptive expansion sufflers. The transmission losses of the mufflers are calculated by the program and compared with experiments. It is found that the prediction is in a good agreement with measurement, except for the absorptive muffler with parallel lining.

• 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.

• Journal of Practical Engineering Education
• /
• v.11 no.1
• /
• pp.51-59
• /
• 2019

This study includes the possibility of organizing courses that can accommodate both NCS-based and course-based qualifications program in terms of contracting departments operating a college-based work and study in parallel system, examining and comparing differences between the two qualifications. Based on the case study of mechanical design engineer based on the job of machine design, curriculum that meets both composition regulation is developed. The author predicts future operational differences and problems and suggests several ways to overcome them. In conclusion, a few words have been added to modify the composition regulations to help the professional educational institute that simultaneously operates a work parallel system and a course evaluation type as to develop the field-oriented curriculum minimizing the gap between provider-centered education and consumer-centered qualifications, and maximizing the performance of training and education.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.8
• /
• pp.421-431
• /
• 2004

This paper presents adaptive execution techniques that determine whether parallelized loops are executed in parallel or sequentially in order to maximize performance. The adaptation and performance estimation algorithms are implemented in a compiler preprocessor. The preprocessor inserts code that automatically determines at compile-time or at run-time the way the parallelized loops are executed. Using a set of standard numerical applications written in Fortran77 and running them with our techniques on a distributed shared memory multiprocessor machine (SGI Origin2000), we obtain the performance of our techniques, on average, 26%, 20%, 16%, and 10% faster than the original parallel program on 32, 16, 8, and 4 processors, respectively. One of the applications runs even more than twice faster than its original parallel version on 32 processors.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.4 no.1
• /
• pp.50-55
• /
• 2004

We propose an intgrated Gill environment system having only integer fuzzy operations in the consequent part and the defuzzification stage. In this paper, we also propose an integrated Gill environment system with 4 parallel fuzzy processing units to be operated in parallel on the classification of the sensed image data. In this, we solve the problems of taking longer times as the fuzzy real computations of [0, 1] by using the integer pixel conversion algorithm to convert lines of each fuzzy linguistic term to the closest integer pixels. This procedure is performed automatically in the GUI application program. As a Gill environment, PCI transmission, image data pre-processing, integer pixel mapping and fuzzy membership tuning are considered. This system can be operated in parallel manner for MIMO or MISO systems.

• Transactions of the Korean Society of Machine Tool Engineers
• /
• v.13 no.3
• /
• pp.68-75
• /
• 2004

Recently, need of the parallel manipulator requiring superior precision is increasing for medical application and precision manufacturing. In this study, we convert a given complex translation trajectory of the moving platform into a set of segments and hence a complex motion of the moving platform can be tractable and easily controled in a very limited workspace. In addition force exerted. to each link is minimized so that the minimized force can be transmitted to the end effector of the moving platform. An user friendly program is developed to design Gough-type 6DOF parallel manupulator based on the proposed method.

• Journal of the Korea Computer Industry Society
• /
• v.8 no.3
• /
• pp.167-172
• /
• 2007

Generally, In a application program the core part for parallel processing is a loop. therefore in this paper, loop interchange parallel compiler is proposed. this is a procedure for the automatic conversion of a loop interchange. According to execution to the outside CDOALL statements of cedar fortran, loop interchange is more effectively method the extracting parallelism in order to parallel processing in iterations. This method will be expected to effectively execution result with mixed into linear conversion and go far toward solving the effectively implementation of the non-unimodular nested loop.

• 한국전산유체공학회:학술대회논문집
• /
• 2005.10a
• /
• pp.157-162
• /
• 2005

Parallel implementation and performance assessment of the grid assembly in a structured chimera grid approach is studied. The grid assembly process, involving hole cutting and searching donor, is parallelized on the PC cluster. A message passing programming model based on the MPI library is implemented using the single program multiple data(SPMD) paradigm. The coarse-grained communication is optimized with the minimized memory allocation because that the parallel grid assembly can access the decomposed geometry data in other processors by only message passing in the distributed memory system such as a PC cluster. The grid assembly workload is based on the static load balancing tied to flow solver. A goal of this work is a development of parallelized grid assembly that is suited for handling multiple moving body problems with large grid size.

• Journal of Industrial Technology
• /
• v.21 no.A
• /
• pp.73-80
• /
• 2001

Barrier is widely used for synchronization in parallel programs. Since the process arrived earlier than others should wait at the barrier, the total processor utilization decreases. In this paper, to find the sources of the barrier waiting time, parallel programs are executed on the various grain sizes through execution-driven simulations. In simulation studies, we found that even if approximately equal amounts of work are distributed to each processor, all processes may not arrive at a barrier at the same time. The reasons are that the different numbers of cache misses and instructions within partitioned grains result in the difference in arrival time of processors at the barrier.