Process-Oriented Parallel Programming with an Application to Data-Intensive Computing

We introduce process-oriented programming as a natural extension of object-oriented programming for parallel computing. It is based on the observation that every class of an object-oriented language can be instantiated as a process, accessible via a remote pointer. The introduction of process pointers requires no syntax extension, identifies processes with programming objects, and enables processes to exchange information simply by executing remote methods. Process-oriented programming is a high-level language alternative to multithreading, MPI and many other languages, environments and tools currently used for parallel computations. It implements natural object-based parallelism using only minimal syntax extension of existing languages, such as C++ and Python, and has therefore the potential to lead to widespread adoption of parallel programming. We implemented a prototype system for running processes using C++ with MPI and used it to compute a large three-dimensional Fourier transform on a computer cluster built of commodity hardware components. Three-dimensional Fourier transform is a prototype of a data-intensive application with a complex data-access pattern. The process-oriented code is only a few hundred lines long, and attains very high data throughput by achieving massive parallelism and maximizing hardware utilization.Comment: 20 pages, 1 figur

GridFTP: Protocol Extensions to FTP for the Grid

GridFTP: Protocol Extensions to FTP for the Gri

Ellipsis, economy, and the (non)uniformity of traces

A number of works have attempted to account for the interaction between movement and ellipsis in terms of an economy condition Max- Elide. We show that the elimination of MaxElide leads to an empirically superior account of these interactions. We show that a number of the core effects attributed to MaxElide can be accounted for with a parallelism condition on ellipsis. The remaining cases are then treated with a generalized economy condition that favors shorter derivations over longer ones. The resulting analysis has no need for the ellipsisspecific economy constraint MaxElide

Is literary language a development of ordinary language?

Contemporary literary linguistics is guided by the 'Development Hypothesis' which says that literary language is formed and regulated by developing only the elements, rules and constraints of ordinary language. Six ways of differentiating literary language from ordinary language are tested against the Development Hypothesis, as are various kinds of superadded constraint including metre, rhyme and alliteration and parallelism. Literary language differs formally, but is unlikely to differ semantically from ordinary language. The article concludes by asking why the Development Hypothesis might hold

Syntactic identity, Parallelism and accommodated antecedents

Analyses of the ellipsis identity condition must account for the fact that some syntactic mismatches between an ellipsis site E and its antecedent A are possible while others are not. Previous accounts have suggested that the relevant distinction is between different kinds of heads, such that some heads in the ellipsis site may mismatch while others may not, and they have dealt with this sensitivity to a set of “special heads” with a built-for-purpose syntactic identity condition which holds over and above semantic identity to constrain ellipsis. In this article I argue against this approach and pursue an alternative which holds that identity is syntactic but “loose” in a precisely defined way. I show that the relevant generalization that accounts for syntactic identity effects in sluicing and VP-ellipsis-like constructions concerns the position of variables in the antecedent, rather than the feature content of syntactic heads. I propose an implementation of syntactic identity which allows for the accommodation of additional antecedents, with these being derived by a grammatical algorithm for generating alternatives, and I show that this implementation derives the right kinds of looseness while restricting mismatches with respect to the position of variables, thus deriving both the tolerable and intolerable mismatches between E and A without recourse to a specific condition regulating the content of special heads

An Intermediate Language and Estimator for Automated Design Space Exploration on FPGAs

We present the TyTra-IR, a new intermediate language intended as a compilation target for high-level language compilers and a front-end for HDL code generators. We develop the requirements of this new language based on the design-space of FPGAs that it should be able to express and the estimation-space in which each configuration from the design-space should be mappable in an automated design flow. We use a simple kernel to illustrate multiple configurations using the semantics of TyTra-IR. The key novelty of this work is the cost model for resource-costs and throughput for different configurations of interest for a particular kernel. Through the realistic example of a Successive Over-Relaxation kernel implemented both in TyTra-IR and HDL, we demonstrate both the expressiveness of the IR and the accuracy of our cost model.Comment: Pre-print and extended version of poster paper accepted at international symposium on Highly Efficient Accelerators and Reconfigurable Technologies (HEART2015) Boston, MA, USA, June 1-2, 201