Joint scheduling for optical grid applications

Yan, Wei; Jin, Yaohui; Guo, Wei; Sun, Weiqiang; Hu, Weisheng; Wu, Min-You

doi:10.1364/jon.6.000304

Cited by 52 publications

(30 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There are three main prediction methods used to predict the link status for the near future as stated in Aguayo et al [17]. These are:…”

Section: Link State Predictionmentioning

confidence: 99%

A Survey: Ad-hoc on Demand Distance Vector (AODV) Protocol

Singh¹,

Kumar²

2017

IJCA

View full text Add to dashboard Cite

The main objective of this paper is to provide background information for understanding of Ad-hoc on demand distance vector (AODV) protocol. This paper provides a critical review of literature on mobile ad-hoc networks and the routing protocols. This paper will discusses the concept and characteristics of mobile ad-hoc networks. The features and classification of the ad-hoc routing protocols & explains the description of Ad-hoc on demand distance vector (AODV) protocol with its mechanisms. This paper also discusses the link failure in mobile ad-hoc networks and the link state prediction is illustrated.

show abstract

“…There are three main prediction methods used to predict the link status for the near future as stated in Aguayo et al [17]. These are:…”

Section: Link State Predictionmentioning

confidence: 99%

A Survey: Ad-hoc on Demand Distance Vector (AODV) Protocol

Singh¹,

Kumar²

2017

IJCA

View full text Add to dashboard Cite

show abstract

“…The recent work on workflow scheduling in optical grids can provision network resources dynamically with guarantee of specified bandwidth [17], [18], [19], [20], [21]. According to the above taxonomy, all those methods use rigid and single path mapping.…”

Section: Introductionmentioning

confidence: 99%

Workflow scheduling in e-Science networks

Jung

Ranka

Sahni

2011

2011 IEEE Symposium on Computers and Communications (ISCC)

View full text Add to dashboard Cite

Abstract-We solve workflow scheduling problems in eScience networks, whose goal is minimizing either makespan or network resource consumption by jointly scheduling heterogeneous resources such as compute and network resources. We formulate the workflow scheduling problem incorporating multiple paths as a mixed integer linear programming (MILP) and develop several linear programming relaxation heuristics based on this formulation. Our algorithms allow dynamic multiple paths for data transfer between tasks and more flexible resource allocation that may vary over time. We evaluate our algorithms against a well-known list scheduling algorithm in e-Science networks whose size is relatively small. Our simulation results show that our heuristics are fast and work well when communication-to-computation ratios (CCRs) are small. Also, these results show that use of dynamic multiple paths and malleable resource allocation is useful for data intensive applications.

show abstract

“…Recent works [6], [7] considered the problem of jointly scheduling computing and network resources for a Directed Acyclic Graph (DAG). The authors Wang et al [6] formulated the problem assuming that a (SONET/SDH) connection of subwavelength granularity can be used to satisfy the communication requirements of a pair of tasks and proposed a heuristic approach to minimize the completion time of the job.…”

Section: Introductionmentioning

confidence: 99%

“…The authors Wang et al [6] formulated the problem assuming that a (SONET/SDH) connection of subwavelength granularity can be used to satisfy the communication requirements of a pair of tasks and proposed a heuristic approach to minimize the completion time of the job. Liu et al [7] formulated the problem for WDM networks.…”

Section: Introductionmentioning

confidence: 99%

Joint Computing and Network Resource Scheduling in a Lambda Grid Network

Lakshmiraman

Ramamurthy

2009

2009 IEEE International Conference on Communications

View full text Add to dashboard Cite

Abstract-Data-intensive Grid applications require huge data transfers between grid computing nodes. These computing nodes, where computing jobs are executed, are usually geographically separated. A grid network that employs optical wavelength division multiplexing (WDM) technology and optical switches to interconnect computing resources with dynamically provisioned multigigabit rate bandwidth lightpath is called a Lambda Grid network. A computing task may be executed on any one of several computing nodes which possesses the necessary resources. In order to reflect the reality in job scheduling, allocation of network resources for data transfer should be taken into consideration. However, few scheduling methods consider the communication contention on Lambda Grids. In this paper, we investigate the joint scheduling problem while considering both optical network and computing resources in a Lambda Grid network. The objective of our work is to maximize the total number of jobs that can be scheduled in a Lambda Grid network. An adaptive routing algorithm is proposed and implemented for accomplishing the communication tasks for every job submitted in the network. Four heuristics (FIFO, ESTF, LJF, RS) are implemented for job scheduling of the computational tasks. Simulation results prove the feasibility and efficiency of the proposed solution.

show abstract

Joint scheduling for optical grid applications

Cited by 52 publications

References 14 publications

A Survey: Ad-hoc on Demand Distance Vector (AODV) Protocol

A Survey: Ad-hoc on Demand Distance Vector (AODV) Protocol

Workflow scheduling in e-Science networks

Joint Computing and Network Resource Scheduling in a Lambda Grid Network

Contact Info

Product

Resources

About