Scheduling of frequently communicating tasks.
Saved in:
| Title: | Scheduling of frequently communicating tasks. |
|---|---|
| Authors: | Papazachos, Zafeirios C.1 (AUTHOR) zpapazac@csd.auth.gr, Karatza, Helen D.1 (AUTHOR) |
| Source: | International Journal of Communication Systems. Feb2012, Vol. 25 Issue 2, p146-157. 12p. 3 Diagrams, 1 Chart, 5 Graphs. |
| Subjects: | Sequential scheduling, Wireless communications, Distribution (Probability theory), Algorithms, Simulation methods & models, Performance evaluation, Information technology |
| Abstract: | SUMMARY Gang scheduling is an efficient resource management scheme for distributed systems which combines elements of time sharing and space sharing. It is a suitable technique particularly in the case when parallel tasks have to be running concurrently to make progress in communication. This paper studies the impact on scheduling performance when dynamically generated sequential gangs exist in the workload. In the case of sequential gangs, a subsequent gang can be dynamically generated after the execution of the initial gang based on affinity information which resides on the caches of the previously seized processors. The performance of different gang-scheduling algorithms is examined for various cases of workload compositions which range from cases with a low demand for dynamically generated gangs to cases with a high ratio of sequential gangs to solitary gangs. A simulation model is implemented to address associated performance issues. Copyright © 2011 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR] |
| Copyright of International Journal of Communication Systems is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| Abstract: | SUMMARY Gang scheduling is an efficient resource management scheme for distributed systems which combines elements of time sharing and space sharing. It is a suitable technique particularly in the case when parallel tasks have to be running concurrently to make progress in communication. This paper studies the impact on scheduling performance when dynamically generated sequential gangs exist in the workload. In the case of sequential gangs, a subsequent gang can be dynamically generated after the execution of the initial gang based on affinity information which resides on the caches of the previously seized processors. The performance of different gang-scheduling algorithms is examined for various cases of workload compositions which range from cases with a low demand for dynamically generated gangs to cases with a high ratio of sequential gangs to solitary gangs. A simulation model is implemented to address associated performance issues. Copyright © 2011 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR] |
|---|---|
| ISSN: | 10745351 |
| DOI: | 10.1002/dac.1260 |
