This paper deals with the self-stabilizing leader election algorithm of Xu and Srimani [10] that finds a leader in a tree graph. The worst case execution time for this algorithm ...
In DHT-based P2P systems, Replication-based content distribution and load balancing strategies consists of such decisions as which files should be replicated, how many replicas sh...
Bassam A. Alqaralleh, Chen Wang, Bing Bing Zhou, A...
Prediction of protein secondary structure (alpha-helix, beta-sheet, coil) from primary sequence of amino acids is a very challenging task, and the problem has been approached from...
In this paper we propose a new query processing method for the OLAP Enabled Grid, which blends sophisticated cache extraction techniques and data grid scheduling to efficiently s...
Michael Lawrence, Frank K. H. A. Dehne, Andrew Rau...
— Frequent failure occurrences are becoming a serious concern to the community of high-end computing, especially when the applications and the underlying systems rapidly grow in ...
Many modern massively distributed systems deploy thousands of nodes to cooperate on a computation task. Network congestions occur in these systems. Most applications rely on conge...
In message-passing parallel applications, messages are not delivered in a strict order. In most applications, the computation results and the set of messages produced during the e...
Basile Schaeli, Sebastian Gerlach, Roger D. Hersch
Graphs capture the essential elements of many problems broadly defined as searching or categorizing. With the rapid increase of data volumes from sensors, many application discipl...
HPC scientific computational models are notoriously difficult to develop, debug, and maintain. The reasons for this are multifaceted — including difficulty of parallel programm...
Steve Quenette, Louis Moresi, P. D. Sunter, Bill F...