Communication and computation rate-cheating problems in divisible load scheduling: revisited
There is extensive literature concerning the Divisible Load Scheduling (DLS). It is a paradigm in the area of parallel and distributed computing. Based on the DLS the computation and communication can be divided into some arbitrary independent parts, in which each part can be processed independently...
| Main Authors: | , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
2015
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/64430/1/ICITE_2015-1.pdf |
| _version_ | 1825949807174221824 |
|---|---|
| author | Ghanbari, Shamsollah Othman, Mohamed Sembiyev, Ordabay Umarova, Zhanat |
| author_facet | Ghanbari, Shamsollah Othman, Mohamed Sembiyev, Ordabay Umarova, Zhanat |
| author_sort | Ghanbari, Shamsollah |
| collection | UPM |
| description | There is extensive literature concerning the Divisible Load Scheduling (DLS). It is a paradigm in the area of parallel and distributed computing. Based on the DLS the computation and communication can be divided into some arbitrary independent parts, in which each part can be processed independently by a processor. The traditional divisible load scheduling assumes that the processors report their true computation and communication rates. In the real applications, the processors may cheat the algorithm which means that the processors might not report their true computation or communication rates. However, the computation rate-cheating problem has been investigated in several research. According to the researchers, the divisible load scheduling only obtains its optimal performance if the processors report their true computation rates. This paper revisits the research concerning the communication and computation rate-cheating problems focusing the effects and open problems. |
| first_indexed | 2024-03-06T09:46:46Z |
| format | Conference or Workshop Item |
| id | upm.eprints-64430 |
| institution | Universiti Putra Malaysia |
| language | English |
| last_indexed | 2024-03-06T09:46:46Z |
| publishDate | 2015 |
| record_format | dspace |
| spelling | upm.eprints-644302018-07-05T09:31:05Z http://psasir.upm.edu.my/id/eprint/64430/ Communication and computation rate-cheating problems in divisible load scheduling: revisited Ghanbari, Shamsollah Othman, Mohamed Sembiyev, Ordabay Umarova, Zhanat There is extensive literature concerning the Divisible Load Scheduling (DLS). It is a paradigm in the area of parallel and distributed computing. Based on the DLS the computation and communication can be divided into some arbitrary independent parts, in which each part can be processed independently by a processor. The traditional divisible load scheduling assumes that the processors report their true computation and communication rates. In the real applications, the processors may cheat the algorithm which means that the processors might not report their true computation or communication rates. However, the computation rate-cheating problem has been investigated in several research. According to the researchers, the divisible load scheduling only obtains its optimal performance if the processors report their true computation rates. This paper revisits the research concerning the communication and computation rate-cheating problems focusing the effects and open problems. 2015 Conference or Workshop Item PeerReviewed text en http://psasir.upm.edu.my/id/eprint/64430/1/ICITE_2015-1.pdf Ghanbari, Shamsollah and Othman, Mohamed and Sembiyev, Ordabay and Umarova, Zhanat (2015) Communication and computation rate-cheating problems in divisible load scheduling: revisited. In: International Conference of Industrial Technologies and Engineering (ICITE 2015), 30-31 Oct. 2015, Shymkent, Kazakhstan. (pp. 296-301). |
| spellingShingle | Ghanbari, Shamsollah Othman, Mohamed Sembiyev, Ordabay Umarova, Zhanat Communication and computation rate-cheating problems in divisible load scheduling: revisited |
| title | Communication and computation rate-cheating problems in divisible load scheduling: revisited |
| title_full | Communication and computation rate-cheating problems in divisible load scheduling: revisited |
| title_fullStr | Communication and computation rate-cheating problems in divisible load scheduling: revisited |
| title_full_unstemmed | Communication and computation rate-cheating problems in divisible load scheduling: revisited |
| title_short | Communication and computation rate-cheating problems in divisible load scheduling: revisited |
| title_sort | communication and computation rate cheating problems in divisible load scheduling revisited |
| url | http://psasir.upm.edu.my/id/eprint/64430/1/ICITE_2015-1.pdf |
| work_keys_str_mv | AT ghanbarishamsollah communicationandcomputationratecheatingproblemsindivisibleloadschedulingrevisited AT othmanmohamed communicationandcomputationratecheatingproblemsindivisibleloadschedulingrevisited AT sembiyevordabay communicationandcomputationratecheatingproblemsindivisibleloadschedulingrevisited AT umarovazhanat communicationandcomputationratecheatingproblemsindivisibleloadschedulingrevisited |