This paper presents a new bi-objective greedy heuristic for scheduling parallel applications on heterogeneous distributed computing systems. The proposed algorithm which is called BSA (bi-objectiveâ€¦ (More)

We present a new algorithm, which solves the problem of distributively finding a minimum diameter spanning tree of any (non-negatively) real-weighted graph G = (V, E, Ï‰). As an intermediate step, weâ€¦ (More)

19th IEEE International Parallel and Distributedâ€¦

2005

In this paper we present an efficient algorithm for compile-time scheduling and clustering of parallel programs onto parallel processing systems with distributed memory, which is called the dynamicâ€¦ (More)

In this paper we present the first distributed algorithm on general graphs for the Minimum Degree Spanning Tree problem. The problem is NP-hard in sequential. Our algorithm give a Spanning Tree of aâ€¦ (More)

In this paper we present an efficient algorithm for compile-time scheduling and clustering of parallel programs onto parallel processing systems with distributed memory, which is called The Dynamicâ€¦ (More)

The main goal of our work is to formally prove the correctness of the key commands of the SCHUR software, an interactive program for calculating with characters of Lie groups and symmetric functions.â€¦ (More)

In their pioneering paper [4], Gallager et al. introduced a distributed algorithm for constructing the minimum-weight spanning tree (MST), many authors have suggested ways to enhance their basicâ€¦ (More)

We present a uniform self-stabilizing algorithm, which solves the problem of distributively nding a minimum diameter spanning tree of an arbitrary positively real-weighted graph. Our algorithmâ€¦ (More)