http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
장유숙,박두순 순천향대학교 부설 산업기술연구소 1997 순천향 산업기술연구소논문집 Vol.3 No.2
The parallelization of loops can be made formal by basing it on an algebraic theory of loop transformation. In this theory, the concept of unimodularity and non-unimodularity arises. We discuss the linear loop transformation framework which is the formal basis for state of the art optimization techniques in restructuring compilers for parallel machines. The framework unifies most existing transformations. We discuss in detail the techniques that generates the transformed loop and derives the desired linear transformation. We present method on loop and data transformations and motivate a unified framework.
장유숙,박두순 순천향대학교 부설 산업기술연구소 2001 순천향 산업기술연구소논문집 Vol.7 No.2
In this paper the proposal of parallelism on sequential loop since most program execution time is consumed in loop structure. This procedure is about automatic transformation to nested DOALL loop and nested loops to reduce data dependency efficiently. And the study to extract the parallelism is about in only one procedure transition. But almost all programs have potential parallelism in between procedures. A procedure call, which has only one loop structure or procedure call, is almost all are concentrated on uniform code, which is in the distance of data dependency in uniform.For the parallelism on loops or procedure that has loops on paralleisms are concentrated on uniform code.We presents algorithms which can be applied with uniform code, nonuniform code and complex code. The proposed algorithm evaluate using CRAY-T3E. The result of performance evaluation is that proposed algorithm is an effect.
장유숙,이상헌,박두순 순천향대학교 부설 산업기술연구소 2000 순천향 산업기술연구소논문집 Vol.6 No.2
Since most program execution time is spent in the loop structure, the researches of transforming sequential programs into parallel programs have been focused on the method of a loop structure transformation. But, most programs have implicit parallelism of interprocedure. Most parallelization of loop with procedure calls just focus on the uniform code. This paper suggestions a way of procedure analysis (an interprocedural analysis and an intraprocedural analysis). We extend the previous loop transformation algorithms for procedure transformation analysis. By using the suggested transformation analysis, we show the examples of parallelization using uniform code, nonuniform code, and complex code, and then evaluate the performance of a sequential and a parallel code using CRAY-T3E.
송월봉,박두순,장유숙 순천향대학교 부설 산업기술연구소 1998 순천향 산업기술연구소논문집 Vol.3 No.3
In this paper we present a new theory of linear loop transformations called Elimination of Data Dependency(EDD). The current framework of linear loop transformation cannot identify a significant fraction of parallelism. For this reason, we presents a method to extract the maximum loop parallelism in perfect nested loops. Our technique is applicable to general loop nests where the dependences include both distances and directions. This theory provides the foundation for solving an open question in complication for parallel machines: which loop transformations, and in what order, should be applied to aceive a particular goal, such as maximizing parallelism. This paper presents an efficient loop transformation algorithm based on this theory to maximize the degree of parallelism in a loop nest. We present the results of experiments that demonstrate that EDD can result in substantial performance improvements.