Yun Hyoung Baek

A number of existing compiler techniques hinge on the analysis of array accesses in a program. The most important task in array access analysis is to collect the information about array accesses of interest and summarize it in some standard form. Traditional forms used in array access analysis are sensitive to the complexity of array subscripts; that is, they are usually quite accurate and efficient for simple array subscripting expressions, but lose accuracy or require potentially expensive alg

Existing array region representation techniques are sensitive to the complexity of array subscripts. In general, these techniques are very accurate and efficient for simple subscript expressions, but lose accuracy or require potentially expensive algorithms for complex subscripts. We found that in scientific applications, many access patterns are simple even when the subscript expressions are complex. In this work, we present a new, general array access representation and define operations for i

A number of arginine derivatives were tested for their ability to inhibit arginine uptake into vacuolar membrane vesicles of Neurospora crassa. The guanido side chain and L-configuration were found to be important for recognition by the arginine carrier. Based upon the specificity of recognition, a reactive arginine derivative (N alpha-p-nitrobenzyloxycarbonyl arginyl diazomethane) was synthesized which has an intact guanido side chain and a diazo group at the carboxyl end. The latter decomposes

Access Form : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 22 2.2.3 Generating Abstract Access Form with Coalescing : : : : : : : : : : : : : 28 2.3 Characteristics of Access Regions : : : : : : : : : : : : : : : : : : : : : : : : : : : 32 2.3.1 Conjunctive Regions : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 34 2.3.2 Complementary Regions : : : : : : : : : : : : : : : : : : : : : : : : : : : : 38 2.3.3 Subregions : : : : : : : : : : : : : : : : : : : : : : : : : : : :

The Cray T3D and T3E are non-cache-coherent (NCC) computers with a NUMA structure. They have been shown to exhibit a very stable and scalable performance for a variety of application programs. Considerable evidence suggests that they are more stable and scalable than many other shared-memory multiprocessors. However, the principal drawback of these machines is a lack of programmability, caused by the absence of the global cache coherence that is necessary to provide a convenient shared view of m

Existing array region representation techniques are sensitive to the complexity of array subscripts. In general, these techniques are very accurate and efficient for simple subscript expressions, but lose accuracy or require potentially expensive algorithms for complex subscripts. We found that in scientific applications, many access patterns are simple even when the subscript expressions are complex. In this work, we present a new, general array access representation and define operations for i

The article explores the applicability of fully automatic parallelizing techniques for parallel computers. We capitalize on a variety of traditional compiling techniques as well as new techniques developed specifically for distributed memory architectures. Combining these traditional and new techniques, we conducted experiments with several benchmark programs on the Cray T3D.

Due to the complexity of programming scalable multiprocessors with physically distributed memories, it is onerous to manually generate parallel code for these machines. As a consequense, there has been much research on the development of compiler techniques to simplify programming, to increase reliability, and to reduce development costs. For code generation, a compiler applies a number of transformations in areas such as data privatization, data copying and replication, synchronization, and dat

This paper focuses on enhancing the performance of the Nth-degree truncated-polynomial ring units key encapsulation mechanism (NTRU-KEM) algorithm, which ensures post-quantum resistance in the field of key establishment cryptography. The NTRU-KEM, while robust, suffers from increased storage and computational demands compared to classical cryptography, leading to significant memory and performance overheads. In environments with limited resources, the negative impacts of these overheads are more