Optimal sequencing and arrangement in distributed single-level tree networks with communication delays

Veeravalli, Bharadwaj; Ghose, Debasish; Mani, V.

doi:10.1109/71.308534

Cited by 81 publications

(65 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In the literature, the effect of sequencing has been shown to have a considerable effect in the case of heterogeneous single-level tree networks [6]. Also, in [9], for the bus networks, it was shown that the optimal processing time remains unaffected regardless of the order in which the load is distributed among the processors by the root processor.…”

Section: Discussion Of the Resultsmentioning

confidence: 99%

“…Second, we identify an important property so far exhibited only by heterogeneous tree networks [6], [9], namely the sequencing in the case of bus networks too. By changing the order in which the load is distributed among the processors, we observe that the processing time is affected.…”

Section: Research Contributionsmentioning

confidence: 99%

“…A similar proof was also presented in [15] for linear networks. In the case of single-level tree networks, a closed-form expression for the processing time had been derived [6], [23] and an algorithm was proposed to obtain an optimal tree configuration for a special case. The concept of optimal sequencing and optimal network arrangement were introduced in [6].…”

Section: Related Workmentioning

confidence: 99%

“…In the case of single-level tree networks, a closed-form expression for the processing time had been derived [6], [23] and an algorithm was proposed to obtain an optimal tree configuration for a special case. The concept of optimal sequencing and optimal network arrangement were introduced in [6]. For homogeneous linear networks, a closed-form expression for the processing time was presented [27] and asymptotic solutions for tree, bus, and linear networks have been rigorously derived [2], [19].…”

Section: Related Workmentioning

confidence: 99%

See 3 more Smart Citations

On the influence of start-up costs in scheduling divisible loads on bus networks

Veeravalli

2000

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

AbstractÐOptimal distribution of divisible loads in bus networks is considered in this paper. The problem of minimizing the processing time is investigated by including all the overhead components that could penalize the performance of the system, in addition to the inherent communication and computation delays. These overheads are considered to be constant additive factors to the respective communication and computation components. Closed-form solution for the processing time is derived and the influence of overheads on the optimal processing time is analyzed. We derive a necessary and sufficient condition for the existence of the optimal processing time. We then study the effect of changing the load distribution sequence on the time performance. Through rigorous analysis, an optimal sequence to distribute the load among the processors is identified, whenever it exists. In case such an optimal sequence fails to exist, we present a greedy algorithm to obtain a suboptimal sequence based on some important properties of the overhead factors. Then, the effect of granularity of the data that is divisible is considered in the analysis for the case of homogeneous networks. An integer approximation algorithm capable of generating integer values of the load fractions in time ym, where m is the number of processors in the network, is proposed. We then show that the upper bound on the suboptimal solution generated by our algorithm lies within a radius given by the sum of the computation and communication delays. Several numerical examples are presented to illustrate the concepts.

show abstract

Section: Discussion Of the Resultsmentioning

confidence: 99%

Section: Research Contributionsmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

On the influence of start-up costs in scheduling divisible loads on bus networks

Veeravalli

2000

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

show abstract

“…the total execution time. Selection and ordering are the most difficult parts of the problem since the α i 's can then be found by solving a simple linear program (closed-form expressions are also available [7,2]). …”

Section: Divisible Load Scheduling Under Memory Constraintsmentioning

confidence: 99%

Independent and Divisible Tasks Scheduling on Heterogeneous Star-shaped Platforms with Limited Memory

Beaumont

Legrand

Marchal

et al.

13th Euromicro Conference on Parallel, Distributed and Network-Based Processing

View full text Add to dashboard Cite

In this paper, we consider the problem of allocating and scheduling a collection of independent, equal-sized tasks on heterogeneous star-shaped platforms. We also address the same problem for divisible tasks. For both cases, we take memory constraints into account. We prove strong NP-completeness results for different objective functions, namely makespan minimization and throughput maximization, on simple star-shaped platforms. We propose an approximation algorithm based on the unconstrained version (with unlimited memory) of the problem. We introduce several heuristics, which are evaluated and compared through extensive simulations. An unexpected conclusion drawn from these experiments is that classical scheduling heuristics that try to greedily minimize the completion time of each task are outperformed by the simple heuristic that consists in assigning the task to the available processor that has the smallest communication time, regardless of computation power (hence a "bandwidth-centric" distribution).

show abstract

A dynamic load balancing method based on network delay for large distributed systems

Nishimura

Ueno

Yamamoto

et al. 2001

Electron. Comm. Jpn. Pt. I

View full text Add to dashboard Cite

The authors propose two dynamic load balancing methods which give consideration to network delays in a large‐scale, wide‐area distributed system. In general in load balancing, the number of candidate computers for transfers increases as the number of computers being used increases, and so efforts are made to improve response time. There is, however, a concern that performance will drop due to delay overhead when candidate destinations for transfers include computers with large delays. Therefore, in this research the authors configure a collection of computers with low network delays as a cluster. They then propose a clustered dynamic load balancing method that emphasizes load information within a cluster and delay information when transfers are performed between clusters, and a threshold dynamic load balancing method which restricts process destinations by creating a threshold value with respect to the ratio between the delay required for a process transfer and the average processing request time for a process. The results of a performance evaluation performed using simulations show that each proposed method can greatly improve the average response time compared to methods that do not consider delays. In addition, each method has an environment in which it is thought to be particularly effective given its operational characteristics. © 2001 Scripta Technica, Electron Comm Jpn Pt 1, 84(6): 11–21, 2001

show abstract

Optimal sequencing and arrangement in distributed single-level tree networks with communication delays

Cited by 81 publications

References 8 publications

On the influence of start-up costs in scheduling divisible loads on bus networks

On the influence of start-up costs in scheduling divisible loads on bus networks

Independent and Divisible Tasks Scheduling on Heterogeneous Star-shaped Platforms with Limited Memory

A dynamic load balancing method based on network delay for large distributed systems

Contact Info

Product

Resources

About