-
Chapter and Conference Paper
Generators-of-Generators Library with Optimization Capabilities in Fortress
A large number of studies have been conducted on parallel skeletons and optimization theorems over skeleton programs to resolve difficulties with parallel programming. However, two nontrivial tasks still remai...
-
Article
A Compositional Framework for Develo** Parallel Programs on Two-Dimensional Arrays
Computations on two-dimensional arrays such as matrices and images are one of the most fundamental and ubiquitous things in computational science and its vast application areas, but development of efficient pa...
-
Chapter and Conference Paper
Efficient Parallel Tree Reductions on Distributed Memory Environments
A new approach for fast parallel reductions on trees over distributed memory environments is proposed. By employing serialized trees as the data representation, our algorithm has a communication-efficient BSP ...
-
Chapter and Conference Paper
Swap** Arguments and Results of Recursive Functions
Many useful calculation rules, such as fusion and tupling, rely on well-structured functions, especially in terms of inputs and outputs. For instance, fusion requires that well-produced outputs should be conne...
-
Chapter and Conference Paper
An Efficient Staging Algorithm for Binding-Time Analysis
Binding-Time Analysis (BTA) is one of the compile-time program analyses which is a general framework for program optimization and program generation [1]. The task of BTA is to divide a source program into two ...
-
Chapter and Conference Paper
A Fusion-Embedded Skeleton Library
This paper addresses a new framework for designing and implementing skeleton libraries, in which each skeleton should not only be efficiently implemented as is usually done, but also be equipped with a structu...
-
Chapter and Conference Paper
On Deforesting Parameters of Accumulating Maps
Deforestation is a well-known program transformation technique which eliminates intermediate data structures that are passed between functions. One of its weaknesses is the inability to deforest programs using...
-
Article
Abstraction from constructors and functional constructors and their applications
Structures using constructors are of ordinary use in functional programming to represent data structures of unbound size. Lack of associativity of constructors, however, hinders program analyses or efficient e...
-
Chapter and Conference Paper
Relating Accumulative and Non-accumulative Functional Programs
We study the problem to transform functional programs, which intensively use append functions (like inefficient list reversal), into programs, which use accumulating parameters instead (like eficient list reve...
-
Article
Modality dependency of familiarity ratings of Japanese words
Familiarity ratings for a large number of aurally and visually presented Japanese words were measured for 11 subjects, in order to investigate the modality dependency of familiarity. The correlation coefficien...
