MULTI-OBJECTIVE AND SCALABLE HEURISTIC ALGORITHM FOR WORKFLOW TASK SCHEDULING IN UTILITY GRIDS

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

KHAJEHVAND VAHID; PEDRAM HOSSEIN; ZANDIEH MOSTAFA

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING) Year:2014 | Volume:8 | Issue:1 (14) Page(s): 27-36

Download Full-Text

View:

341

Download:

160

Cites:

Information Journal Paper

Title

MULTI-OBJECTIVE AND SCALABLE HEURISTIC ALGORITHM FOR WORKFLOW TASK SCHEDULING IN UTILITY GRIDS

Author(s)

KHAJEHVAND VAHID | PEDRAM HOSSEIN | ZANDIEH MOSTAFA | Issue Writer Certificate

Keywords

UTILITY GRIDS

RESOURCE PROVISIONING

WORKFLOW SCHEDULING

MULTI-OBJECTIVE OPTIMIZATION

SCALABILITY

Abstract

To use services transparently in a distributed environment, the UTILITY GRIDS develop a cyber-infrastructure. The parameters of the Quality of Service such as the allocation-cost and makespan have to be dealt with in order to schedule workflow application tasks in the UTILITY GRIDS. Optimization of both target parameters above is a challenge in a distributed environment and may conflict one another. We, therefore, present a novel heuristic algorithm for scheduling a workflow application on UTILITY GRIDS. Our proposed algorithm optimizes the allocation-cost and makespan in a scalable and very low runtime. The results of the wide-spread simulation indicate that the proposed algorithm is scalable against an increase in the application size and task parallelism of the application. The proposed algorithm effectively outperforms the current algorithms in terms of the allocation-cost, makespan and runtime SCALABILITY.

Cites

No record.

References

Cite

APA: Copy

KHAJEHVAND, VAHID, PEDRAM, HOSSEIN, & ZANDIEH, MOSTAFA. (2014). MULTI-OBJECTIVE AND SCALABLE HEURISTIC ALGORITHM FOR WORKFLOW TASK SCHEDULING IN UTILITY GRIDS. JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING), 8(1 (14)), 27-36. SID. https://sid.ir/paper/631404/en

Vancouver: Copy

KHAJEHVAND VAHID, PEDRAM HOSSEIN, ZANDIEH MOSTAFA. MULTI-OBJECTIVE AND SCALABLE HEURISTIC ALGORITHM FOR WORKFLOW TASK SCHEDULING IN UTILITY GRIDS. JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING)[Internet]. 2014;8(1 (14)):27-36. Available from: https://sid.ir/paper/631404/en

IEEE: Copy

VAHID KHAJEHVAND, HOSSEIN PEDRAM, and MOSTAFA ZANDIEH, “MULTI-OBJECTIVE AND SCALABLE HEURISTIC ALGORITHM FOR WORKFLOW TASK SCHEDULING IN UTILITY GRIDS,” JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING), vol. 8, no. 1 (14), pp. 27–36, 2014, [Online]. Available: https://sid.ir/paper/631404/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops