OPTIMIZATION OF TASKS IN CLOUD COMPUTING BASED ON MAX-MIN, MIN-MIN AND PRIORITY

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.

Derakhshan Majid; BATENI ZOHREH

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

Seminar Paper

Paper Information

Seminar: INTERNATIONAL CONFERENCE ON WEB RESEARCH
Year:2018 | Issue:4

Download Full-Text

View:

112

Download:

141

Information Seminar Paper

Title

OPTIMIZATION OF TASKS IN CLOUD COMPUTING BASED ON MAX-MIN, MIN-MIN AND PRIORITY

Author(s)

Derakhshan Majid | BATENI ZOHREH

Keywords

TOMMP ALGORITHM

OPTIMAL SCHEDULING ALGORITHM

SCHEDULING ALGORITHM

CLOUD SCHEDULING ALGORITHM

MIN-MIN ALGORITHM

MAX-MIN ALGORITHM

CLOUD COMPUTING

Abstract

ACCORDING TO THE INCREASING USAGE OF CLOUD COMPUTING AND NECESSITY OF OPTIMIZE USAGE OF RESOURCES, AND CONSIDERING TO USERS WHO PAY FOR SERVICES BY THEM USAGE (PAY-AS-YOU-GO), THERE SHOULD BE A QUICKER WAY FOR USERS TO DECREASE THE USER'S WAITING TIME AND TASK'S MAKES PANE. THE MAIN PURPOSE OF THIS PAPER IS TO PROVIDE AN OPTIMAL ALGORITHM USING THE ADVANTAGES OF TWO TRADITIONAL ALGORITHMS: MIN-MIN AND MAX-MIN. OTHER POINT THAT FOLLOW IN TOMMP ALGORITHM IS THE PRIORITY OF THE TASKS. THERE ARE A LOT OF SCHEDULING ALGORITHMS IN THE WORLD TODAY, BUT IN MOST ALGORITHMS THE PRIORITY GIVEN TO THE TASK HAS BEEN NEGLECTED AND OVERLOOKED. IN THIS ALGORITHM, PRIORITY IS FIRSTLY SELECTED FOR TASKS BASED ON A PRIORITIZATION ALGORITHM, AND THEN USING THE MEDIAN NUMBER TO DECIDE WHICH ONE OF THE MIN-MIN OR MAX-MIN ALGORITHMS IS TO BE USED. IT SHOULD BE NOTED THAT ACCORDING TO THE TOMMP ALGORITHMS, ITS MAKES PANE IS LOWER THAN COMPARISONS OF THE COMPARED ALGORITHMS AND IT’S SHOWN TO BE BETTER THAN THE COMPARABLE ALGORITHMS.

Cites

No record.

References

No record.

Cite

APA: Copy

Derakhshan, Majid, & BATENI, ZOHREH. (2018). OPTIMIZATION OF TASKS IN CLOUD COMPUTING BASED ON MAX-MIN, MIN-MIN AND PRIORITY. INTERNATIONAL CONFERENCE ON WEB RESEARCH. SID. https://sid.ir/paper/948808/en

Vancouver: Copy

Derakhshan Majid, BATENI ZOHREH. OPTIMIZATION OF TASKS IN CLOUD COMPUTING BASED ON MAX-MIN, MIN-MIN AND PRIORITY. 2018. Available from: https://sid.ir/paper/948808/en

IEEE: Copy

Majid Derakhshan, and ZOHREH BATENI, “OPTIMIZATION OF TASKS IN CLOUD COMPUTING BASED ON MAX-MIN, MIN-MIN AND PRIORITY,” presented at the INTERNATIONAL CONFERENCE ON WEB RESEARCH. 2018, [Online]. Available: https://sid.ir/paper/948808/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops