TASK SCHEDULING IN CLOUD COMPUTING USING PARTICLE SWARM OPTIMIZATION

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.

JAMALI SHAHRAM; ALIZADEH FATEMEH; Sadeqi Soheila

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

Seminar Paper

Paper Information

Seminar: INTERNATIONAL CAUCASUS UNIVERSITIES ASSOCIATION GRADUATE STUDENTS SYMPOSIUM
Year:2016 | Issue:3

Download Full-Text

View:

242

Download:

385

Information Seminar Paper

Title

TASK SCHEDULING IN CLOUD COMPUTING USING PARTICLE SWARM OPTIMIZATION

Author(s)

JAMALI SHAHRAM | ALIZADEH FATEMEH | Sadeqi Soheila

Keywords

CLOUD COMPUTING

TASK SCHEDULING

PARTICLE SWARM OPTIMIZATION

MAKESPAN

Abstract

CLOUD COMPUTING IS THE GROWTH OF DISTRIBUTED COMPUTING, PARALLEL COMPUTING, UTILITY COMPUTING AND GRID COMPUTING, OR DEFINED AS THE COMMERCIAL IMPLEMENTATION OF THESE COMPUTER SCIENCE THEORIES. ONE OF THE FUNDAMENTAL ISSUES IN CLOUD ENVIRONMENT IS THE TASK SCHEDULING WHICH PLAYS THE KEY ROLE OF EFFICIENCY OF THE WHOLE CLOUD COMPUTING FACILITIES. SCHEDULING MAPS THE USER’S TASKS TO RESOURCES TO BE EXECUTED EFFICIENTLY IN ORDER TO BENEFIT BOTH THE SERVICE PROVIDERS AND CUSTOMERS. SINCE THE CLOUD TASK SCHEDULING IS AN NP-HARD OPTIMIZATION PROBLEM, MANY META-HEURISTIC ALGORITHMS HAVE BEEN PROPOSED TO SOLVE IT. IN THIS PAPER A POLICY BASED ON PARTICLE SWARM OPTIMIZATION COMPARED WITH GENETIC ALGORITHM AND FCFS, HAS BEEN INTRODUCED. PSO IS A POPULATION-BASED SEARCH ALGORITHM BASED ON THE SIMULATION OF THE SOCIAL BEHAVIOUR OF BIRDS WITHIN THE FLOCK. THE MAIN GOAL IN THIS RESEARCH IS MINIMIZING THE MAKESPAN AND WAITING TIME OF A GIVEN TASKS SET. PROPOSED POLICY AND TWO OTHER ALGORITHMS HAVE BEEN SIMULATED USING CLOUDSIM TOOLKIT PACKAGE. THE RESULTS SHOWED THAT PSO PERFORMED BETTER THAN GENETIC AND FCFS ALGORITHMS.

Cites

No record.

References

No record.

Cite

APA: Copy

JAMALI, SHAHRAM, ALIZADEH, FATEMEH, & Sadeqi, Soheila. (2016). TASK SCHEDULING IN CLOUD COMPUTING USING PARTICLE SWARM OPTIMIZATION. INTERNATIONAL CAUCASUS UNIVERSITIES ASSOCIATION GRADUATE STUDENTS SYMPOSIUM. SID. https://sid.ir/paper/940727/en

Vancouver: Copy

JAMALI SHAHRAM, ALIZADEH FATEMEH, Sadeqi Soheila. TASK SCHEDULING IN CLOUD COMPUTING USING PARTICLE SWARM OPTIMIZATION. 2016. Available from: https://sid.ir/paper/940727/en

IEEE: Copy

SHAHRAM JAMALI, FATEMEH ALIZADEH, and Soheila Sadeqi, “TASK SCHEDULING IN CLOUD COMPUTING USING PARTICLE SWARM OPTIMIZATION,” presented at the INTERNATIONAL CAUCASUS UNIVERSITIES ASSOCIATION GRADUATE STUDENTS SYMPOSIUM. 2016, [Online]. Available: https://sid.ir/paper/940727/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops