We study parallel algorithms for computing the minimum spanning tree of a weighted undirected graph G with n vertices and m edges. We consider an input graph G with m=n p, where p...
Abstract--Intervals are a new model for parallel programming based on an explicit happens before relation. Intervals permit fine-grained but high-level control of the program sched...
In this article, we introduce the ongoing research in modeling and mapping for heterogeneous, customizable, parallel systems, as part of the effort in the newly established Center...
Quantitative Structure Activity/Property Relationship (QSAR/QSPR) model development is a complex and time-consuming procedure involving data gathering and preparation. It plays an ...
Sulev Sild, Uko Maran, Mathilde Romberg, Bernd Sch...
This paper presents a new LogP-based model, called LoOgGP, which allows an accurate characterization of MPI applications based on microbenchmark measurements. This new model is an...