This paper presents many different parallel formulations of the A*/Branch-and-Bound search algorithm. The parallel formulations primarily differ in the data structures used. Some formulations are suited only for shared-memory architectures, whereas others are suited for distributedmemory architectures as well. These parallel formulations have been implemented to solve the vertex cover problem a...

ProperCAD II is a C++ object oriented library supporting actor based parallel program design. The library easily allows the design of data structures with parallel semantics for use in irregular applications. Inheritance mechanisms allow creation of the distributed data structures from standard C++ objects. This paper discusses the use of such distributed data structures in the context of a par...

In this position paper, we point out the importance of teaching a basic understanding of parallel computations and parallel programming early in computer science education, in order to give students the necessary expertise to cope with future computer architectures that will exhibit an explicitly parallel programming model. We elaborate on a programming model, namely sharedmemory bulk-synchrono...

X-ray diffraction measurements were performed on Co?Pt1-?/Pd, Co/Pd, Co/Fe, and Co/W multilayer samples with different structures, such as Co?Pt1-? alloy layer composition ?, bilayer thickness, and number of bilayers. Multilayer samples were made by magnetron sputtering in a chamber with multi-parallel guns and a position controllable substrate. Co?Pt1-? alloy layers were deposited by cosputter...

Contour Crafting is an emerging technology that uses robotics to construct free form building structures by repeatedly laying down layers of material such as concrete. The Contour Crafting technology scales up automated additive fabrication from building small industrial parts to constructing buildings. Tool path planning and optimization for Contour Crafting benefit the technology by increasin...

This paper covers a description of the algorithms and data-structures used in the parallel DLR TAU-Code Adaptation tool. Attention is given to the basic algorithms of the parallel anisotropic refinement and de-refinement, as well as the data-structures for distributed grids and grid hierarchy. The parallelization issues for distributed data are discussed along with the dynamic repartitioning an...

We develop a generic programming language for parallel algorithms, one that works for all data structures and control structures. We show that any parallel algorithm satisfying intuitively-appealing postulates can be modeled by a collection of cells, each of which is an abstract state machine, augmented with the ability to spawn new cells. The cells all run the same algorithm and communicate vi...

ÐThe aromatic diacid residue 4,6-dibenzofuranbispropionic acid (1) was designed to nucleate a parallel b-sheet-like structure in small peptides in aqueous solution via a hydrogen-bonded hydrophobic cluster. Even though a 14-membered ring hydrogen bond necessary for parallel b-sheet formation is favored in simple amides composed of 1, this hydrogen bonding interaction does not appear to be suci...