This paper sets to analyse the hermeneutical process of highlighting at work in preface written by North Irish poet Seamus Heaney his retranslations Beowulf (1999). My analysis takes into account generic identity considering it as a textual subgenre where translator becomes metatranslator voice herself out invisibility, engages (self-reflexive) and “justification” commenting on choice translate...

We introduce the design of a fully parallel framework for quickly analyzing large-scale RDF data over distributed architectures. We present three core operations of this framework: dictionary encoding, parallel joins and indexing processing. Preliminary experimental results on a commodity cluster show that we can load large RDF data very fast while remaining within an interactive range for quer...

Comparison of the DNA sequences and genes of two genomes can be useful to investigate the common functionalities of the corresponding organisms and get a better understanding of how the genes or groups of genes are organized and involved in several functions. In this paper we use high-performance parallel computing to compare the whole genomes of two organisms, namely Xanthomonas axonopodis pv....

This paper presents a parallel data mining application for predictive modelling running on a Beowulf style Linux cluster. Data mining or Knowledge Discovery in Databases (KDD) is the process of analysing large and complex data sets with the purpose of extracting useful and previously unknown knowledge. The task of predictive modelling is the prediction of an attribute according to a model built...

The ZhongShan University Computational Physics group’s interests [1] cover such topics as lattice QCD[2–5] quantum instanton[6] and quantum chaos[7]. Most of these topics can be studied through Monte Carlo simulation, but can be quite costly in terms of computing power. In order to do large scale numerical investigations of these topics, we required a corresponding development of our local comp...

We suggest modiications in the local computations of the ScaLAPACK subroutines for solving diagonally dominant and arbitrary narrow-banded linear systems. The modiications concern the way auxiliary variables are stored. The numerical properties of the algorithms are not aaected. However, as the way the memory is accessed is changed the performance of the solvers is signiicantly improved. We dis...

This work studies the application of Genetic Algorithm (GA) to solve the timetable problem (TTP), a problem that is a highly constrained problem. However, the major disadvantage of GA is that the algorithm uses a tremendous amount of processing time. This paper proposes a method that can reduce the processing time by using Parallel Genetic Algorithm (PGA) on the Beowulf-style cluster computer. ...

This paper presents a practical evaluation and comparison of three state-of-the-art parallel functional languages. The evaluation is based on implementations of three typical symbolic computation programs, with performance measured on a Beowulf-class parallel architecture. ∗This work is primarily supported by the Austrian Academy of Sciences (APART fellowship 624), the Japan Society for the Pro...

Scyld has introduced a new framework and set of tools for constructing single system image Beowulf clusters. This talk will cover the development direction of the system, including enhancements to the security model, and the implications of extending the system model to support multiple front-end "master". It will also cover other aspects of the system, such as an integrated scheduler and enhan...