PRE-SCHEDULING AND SCHEDULING OF TASK GRAPH ON HOMOGENEOUS MULTIPROCESSOR SYSTEMS

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.

ABDEYAZDAN MARJAN; PARSA SAEED; RAHMANI AMIR MASOUD

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

Journal Paper

Paper Information

Journal: JOURNAL OF ADVANCES IN COMPUTER RESEARCH Year:2013 | Volume:4 | Issue:1 (11) Page(s): 13-29

Download Full-Text

View:

481

Download:

133

Cites:

Information Journal Paper

Title

PRE-SCHEDULING AND SCHEDULING OF TASK GRAPH ON HOMOGENEOUS MULTIPROCESSOR SYSTEMS

Author(s)

ABDEYAZDAN MARJAN | PARSA SAEED | RAHMANI AMIR MASOUD | Issue Writer Certificate

Keywords

SCHEDULE

PRE-SCHEDULE

TASK GRAPH

GAME THEORY

OPTIMIZATION

NASH EQUILIBRIUM

Abstract

Task graph scheduling is a multi-objective OPTIMIZATION and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the other one. The problem is to achieve the trade-off between these two parameters. Pre-scheduling algorithms are mainly aimed at modifying the structure of TASK GRAPH to gain optimal scheduling.In the proposed algorithm the suitable number of processors for scheduling the TASK GRAPH is computed. The idea of NASH EQUILIBRIUM is mainly applied to compute the appropriate number of processors in such a way that the idle time of the processors is reduced while their processing power is increased. Also, considering the communication costs and interdependencies, the tasks are merged as their earliest start time is reduced. In this way, the length of the critical path is reduced while the degree of parallelism is increased and ultimately the completion time is reduced. Our experimental result on a number of known benchmark graphs demonstrates the effect of our proposed algorithm.

Cites

No record.

References

Cite

APA: Copy

ABDEYAZDAN, MARJAN, PARSA, SAEED, & RAHMANI, AMIR MASOUD. (2013). PRE-SCHEDULING AND SCHEDULING OF TASK GRAPH ON HOMOGENEOUS MULTIPROCESSOR SYSTEMS. JOURNAL OF ADVANCES IN COMPUTER RESEARCH, 4(1 (11)), 13-29. SID. https://sid.ir/paper/328729/en

Vancouver: Copy

ABDEYAZDAN MARJAN, PARSA SAEED, RAHMANI AMIR MASOUD. PRE-SCHEDULING AND SCHEDULING OF TASK GRAPH ON HOMOGENEOUS MULTIPROCESSOR SYSTEMS. JOURNAL OF ADVANCES IN COMPUTER RESEARCH[Internet]. 2013;4(1 (11)):13-29. Available from: https://sid.ir/paper/328729/en

IEEE: Copy

MARJAN ABDEYAZDAN, SAEED PARSA, and AMIR MASOUD RAHMANI, “PRE-SCHEDULING AND SCHEDULING OF TASK GRAPH ON HOMOGENEOUS MULTIPROCESSOR SYSTEMS,” JOURNAL OF ADVANCES IN COMPUTER RESEARCH, vol. 4, no. 1 (11), pp. 13–29, 2013, [Online]. Available: https://sid.ir/paper/328729/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops