Cryptographic algorithms are increasingly used in personal transaction through Internet network, smart card and telecommunication applications. Those algorithms are well known for their high complexity data computing. This paper focuses on Montgomery algorithm, which computes modular multiplication efficiently. This operation is the most time consuming part of public-key cryptosystems. A compar...

In this paper, we describe the structure of C parallelizing compiler based on the functional parallelism. For generating coarse grain processes, the function-oriented division strategy is adapted in our compiler. In our process generation method, a function written in the program is a unit of coarse grain distributed processes. Our compiler is constructed as a preprocessor on GNU C compiler. We...

It has long been thought that coarse-grain parallelism is much more efficient than fine-grain parallelism due to the overhead of process (thread) creation, context switching, and synchronization. On the other hand, there are several advantages to fine-grain parallelism: architecture independence, ease of programming, ease of use as a target for code generation, and load-balancing potential. Thi...

The main idea behind UPC is that users should be able to view the underlying machine model as a collection of threads operating in a common global address [5]. In such an environment fine-grain algorithms are preferred to coarse-grain algorithms since they are easier to code. While such algorithms, written in UPC, should have similar performance in shared memory environments compared to OpenMP,...

Zinc (Zn) deficiency is a common disorder of humans in developing countries. The effect of Zn biofortification (via application of six rates of Zn fertilizer to soil) on Zn bioavailability in wheat grain and flour and its impacts on human health was evaluated. Zn bioavailability was estimated with a trivariate model that included Zn homeostasis in the human intestine. As the rate of Zn fertiliz...

coarse grain reconfigurable architectures are specially suited for the systems where power consumption and flexibility is important factor while performing large computational operation. CGRA mostly used as an accelerator for various applications to get high throughputs and parallelism. This paper gives design summary of novel coarse grain architecture which can be used as an accelerator for th...

Generalized adjoint with modified discretization and generalized coarse-grain adjoint are derived for a vector system of equations that contains parameterized on/off switches. With vector examples, it is shown that the conventional adjoint minimization may have a convergence problem in multidimensional space. The problem can be solved by the generalized adjoint with modified discretization or b...