Effectiveness of elicitation techniques in distributed requirements engineering

WJ Lloyd, MB Rosson, JD Arthur - Proceedings IEEE Joint …, 2002 - ieeexplore.ieee.org
Software development teams are often geographically distributed from their customers and
end users. This creates significant communication and coordination challenges that impact …

LogGPS: a parallel computational model for synchronization analysis

F Ino, N Fujimoto, K Hagihara - Proceedings of the eighth ACM SIGPLAN …, 2001 - dl.acm.org
We present a new parallel computational model, named LogGPS, which captures
synchronization. The LogGPS model is an extension of the LogGP model, which abstracts …

A data distributed parallel algorithm for nonrigid image registration

F Ino, K Ooyama, K Hagihara - Parallel Computing, 2005 - Elsevier
Image registration is a technique for defining a geometric relationship between each point in
images. This paper presents a data distributed parallel algorithm that is capable of aligning …

[PDF][PDF] Portals 3.0: Protocol building blocks for low overhead communication

R Brightwell, R Riesen, B Lawry… - … 16th International Parallel …, 2002 - academia.edu
This paper describes the evolution of the Portals message passing architecture and
programming interface from its initial development on tightly-coupled massively parallel …

PM2: High performance communication middleware for heterogeneous network environments

T Takahashi, S Sumimoto, A Hori… - SC'00: Proceedings …, 2000 - ieeexplore.ieee.org
This paper introduces a high performance communication middle layer, called PM2, for
hetero-geneous network environments. PM2 currently supports Myrinet, Ethernet, and SMP …

Automatic code generation for distributed memory architectures in the polytope model

M Claßen, M Griebl - Proceedings 20th IEEE International …, 2006 - ieeexplore.ieee.org
The polytope model has been used successfully as a tool for program analysis and
transformation in the field of automatic loop parallelization. However, for the final step of …

Mpich/madeleine: a true multi-protocol mpi for high performance networks

O Aumage, G Mercier, R Namyst - … 15th International Parallel …, 2001 - ieeexplore.ieee.org
This paper introduces a version of MPICH handling efficiently different networks
simultaneously. The core of the implementation relies on a device called ch-mad which is …

An improved binary-swap compositing for sort-last parallel rendering on distributed memory multiprocessors

A Takeuchi, F Ino, K Hagihara - Parallel Computing, 2003 - Elsevier
Sort-last parallel rendering is a good rendering scheme on distributed memory
multiprocessors. This paper presents an improvement on the binary-swap (BS) method …

Locality and parallelism optimization for dynamic programming algorithm in bioinformatics

G Tan, S Feng, N Sun - Proceedings of the 2006 ACM/IEEE Conference …, 2006 - dl.acm.org
Dynamic programming has been one of the most efficient approaches to sequence analysis
and structure prediction in biology. However, their performance is limited due to the drastic …

[PDF][PDF] Rwc pc cluster ii and score cluster system software–high performance linux cluster

Y Ishikawa, H Tezuka, A Hori, S Sumimoto… - Proceedings of the 5th …, 1999 - pccluster.org
ABSTRACT The RWC PC Cluster II, consisting of 128 Intel Pentium Pro microprocessors
connected by a Myricom Myrinet giga-bit network, achieves the comparable speed of a …