Time Delay Analysis for a Parallel Steiner tree Algorithm
نویسنده
چکیده
This paper presents the computational analysis of the Steiner tree problem on the Server-Client model of computation. In particular, this work analyzes the time delays among server and clients for the parallel Steiner tree algorithm and examines some consequences of time delays on the execution time by considering constant and variable delays. The paper also calculates the expression for the optimal number of client processors required by the parallel algorithm for optimal efficiency. The compact mathematical expressions can be used confidently to implement parallel Steiner tree on the Server-Client model of computation.
منابع مشابه
Parallel Greedy Adaptive Search Algorithm for Steiner Tree Problem
In this paper, a parallel algorithm for the Steiner tree problem is presented. The algorithm is based on the well-known multi-start paradigm the GRASP and the well-known proximity structures from computational geometry. The main contribution of this paper is the O(n log n+log n log( n log n )) parallel algorithm for computing Steiner tree on the Euclidean plane. The parallel algorithm used prox...
متن کاملAn Iterative Approach for Delay-Bounded Minimum Steiner Tree Construction
This paper presents a delay-bounded minimum Steiner tree algorithm. The delay bounds, given as inputs to the algorithm, can be diierent for each individual source-sink connection. The approach is based on feasible search optimization that satisses the delay bounds rst, then improves the routing tree for the cost minimization. Iterative cut-and-link tree transformation constrained by delay bound...
متن کاملApproximation Algorithms for the Restricted Steiner Tree Problem
We consider the problem of finding minimum cost Steiner trees with delay constraints. In this problem, referred to as the Restricted Steiner Tree problem, we are given a directed graph , in which each edge is associated with two parameters, namely delay and cost. We seek a minimum cost tree that connects a source with a set of terminals , such that the delay of the path in between and each term...
متن کاملParallel Generation of t-ary Trees
A parallel algorithm for generating t-ary tree sequences in reverse B-order is presented. The algorithm generates t-ary trees by 0-1 sequences, and each 0-1 sequences is generated in constant average time O(1). The algorithm is executed on a CREW SM SIMD model, and is adaptive and cost-optimal. Prior to the discussion of the parallel algorithm a new sequential generation with O(1) average time ...
متن کاملThe delay-constrained minimum spanning tree problem
We formulate the problem of constructing broadcast trees for real-time traffic with delay constraints in networks with asymmetric link loads as a delay-constrained minimum spanning tree (DCMST) problem in directed networks. Then, we prove that this problem is NP-complete, and we propose an efficient heuristic to solve the problem based on Prim’s algorithm for the unconstrained minimum spanning ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008