1383-7621/$ see front matter 2008 Elsevier B.V. A doi:10.1016/j.sysarc.2008.02.008 q Expanded version of [1]. This work has been partia of Excellence CoreGRID funded by the European Com 004265). * Corresponding author. E-mail addresses: [email protected] (M. Ald (M. Danelutto). Algorithmic skeletons have been exploited to implement several parallel programming environments, targeting workstat...

We describe two parallel algorithms for line opacity calculations based on a local file and on a global file approach. The performance and scalability of both approaches is discussed for different test cases and very different parallel computing systems. The results show that a global file approach is more efficient on high-performance parallel supercomputers with dedicated parallel I/O subsyst...

In this paper, six portable parallel programming environments are compared. For each environment, communication bandwidths are reported for simple 2 node and 4 node benchmarks. Reproducibility was a top priority , so these tests were run on an isolated ethernet network of identical SPARCstation 1 workstations. Earlier reports of this work omitted opinions reached during the benchmarking about t...

Parallel computing on interconnected workstations is becoming a viable and attractive proposition due to the rapid growth in speeds of interconnection networks and processors. In the case of workstation clusters, there is always a considerable amount of unused computing capacity available in the network. However, heterogeneity in architectures and operating systems, load variations on machines,...

In this paper, we present a parallel algorithm running on a shared memory multi-processor workstation for timing driven standard cell layout. The proposed algorithm is based on POPINS2.0 [13] and consists of three phases. First, we get an initial placement by a hierarchical timing-driven mincut placement algorithm. At the top level of partitioning hierarchy, we perform one step of bi-partitioni...