Energy Aware Scheduling for Unrelated Parallel Machines
We consider the problem of energy aware scheduling of a set of jobs on a set of unrelated parallel machines with the average weighted completion time plus energy objective. The processing time and the energy consumption of the jobs are machine and speed dependent. Also, every job is subject to a mac...
Gespeichert in:
| Veröffentlicht in: | 2012 IEEE/ACM International Conference on Green Computing and Communications S. 533 - 540 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Tagungsbericht |
| Sprache: | Englisch |
| Veröffentlicht: |
IEEE
01.11.2012
|
| Schlagworte: | |
| ISBN: | 9781467351461, 1467351466 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | We consider the problem of energy aware scheduling of a set of jobs on a set of unrelated parallel machines with the average weighted completion time plus energy objective. The processing time and the energy consumption of the jobs are machine and speed dependent. Also, every job is subject to a machine-dependent release date. Firstly, we aim to find a non-preemptive schedule of the jobs minimizing the average weighted completion time plus energy, and we propose a randomized approximation algorithm that we derandomize obtaining a deterministic approximation algorithm. We then consider the budget variant of the problem where the objective is to minimize the average completion time while the total energy consumption does not exceed a given budget. |
|---|---|
| AbstractList | We consider the problem of energy aware scheduling of a set of jobs on a set of unrelated parallel machines with the average weighted completion time plus energy objective. The processing time and the energy consumption of the jobs are machine and speed dependent. Also, every job is subject to a machine-dependent release date. Firstly, we aim to find a non-preemptive schedule of the jobs minimizing the average weighted completion time plus energy, and we propose a randomized approximation algorithm that we derandomize obtaining a deterministic approximation algorithm. We then consider the budget variant of the problem where the objective is to minimize the average completion time while the total energy consumption does not exceed a given budget. |
| Author | Bampis, E. Kacem, F. Angel, E. |
| Author_xml | – sequence: 1 givenname: E. surname: Angel fullname: Angel, E. email: eric.angel@ibisc.fr organization: IBISC, Univ. d'Evry Val d'Essonne, Evry, France – sequence: 2 givenname: E. surname: Bampis fullname: Bampis, E. email: evripidis.bampis@lip6.fr organization: LIP6, UPMC (Paris 6), Paris, France – sequence: 3 givenname: F. surname: Kacem fullname: Kacem, F. email: fadi.kacem@ibisc.fr organization: IBISC, Univ. d'Evry Val d'Essonne, Evry, France |
| BookMark | eNotjM1Kw0AURkdUUGv2gpt5gcQ7mb87yxJqFSoK2nWZJHeaSDqRSUX69i3q5jucs_hu2EUcIzF2J6AQAtzDMhHFatwVJYiysHjGMmcRrHFaodHq_NeFMlbq04orlk3TJwAIkBqcvmZ2ESltD3z-4xPx96aj9nvo45aHMfF1TDT4PbX8zSc_DDTwF990faTpll0GP0yU_XPG1o-Lj-opX70un6v5Ku9KcPu8FsbqEEh6F0xjra5tcA06pWposfQkm1CqUKMNCMEjGuEFttieenCG5Izd__32RLT5Sv3Op8PGKIPSCHkEFp5K5Q |
| CODEN | IEEPAD |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IL CBEJK RIE RIL |
| DOI | 10.1109/GreenCom.2012.78 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Xplore POP ALL IEEE Xplore All Conference Proceedings IEEE Electronic Library (IEL) IEEE Proceedings Order Plans (POP All) 1998-Present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| EISBN | 9780769548654 0769548652 |
| EndPage | 540 |
| ExternalDocumentID | 6468361 |
| Genre | orig-research |
| GroupedDBID | 6IE 6IF 6IK 6IL 6IN AAJGR AAWTH ADFMO ALMA_UNASSIGNED_HOLDINGS BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK IEGSK IERZE OCL RIB RIC RIE RIL |
| ID | FETCH-LOGICAL-h209t-b1675ffe3a9f6c775b7f9c8944b0d82ae3cf24fb87f80fa8861a18d8d3cff96e3 |
| IEDL.DBID | RIE |
| ISBN | 9781467351461 1467351466 |
| ISICitedReferencesCount | 14 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000316905100074&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| IngestDate | Wed Aug 27 04:26:12 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-h209t-b1675ffe3a9f6c775b7f9c8944b0d82ae3cf24fb87f80fa8861a18d8d3cff96e3 |
| PageCount | 8 |
| ParticipantIDs | ieee_primary_6468361 |
| PublicationCentury | 2000 |
| PublicationDate | 2012-Nov. |
| PublicationDateYYYYMMDD | 2012-11-01 |
| PublicationDate_xml | – month: 11 year: 2012 text: 2012-Nov. |
| PublicationDecade | 2010 |
| PublicationTitle | 2012 IEEE/ACM International Conference on Green Computing and Communications |
| PublicationTitleAbbrev | greencom |
| PublicationYear | 2012 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| SSID | ssj0001035095 |
| Score | 1.5749502 |
| Snippet | We consider the problem of energy aware scheduling of a set of jobs on a set of unrelated parallel machines with the average weighted completion time plus... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 533 |
| SubjectTerms | approximation algorithm Approximation algorithms Approximation methods Computational modeling Energy consumption Polynomials Program processors randomization Schedules scheduling unrelated machines weighted completion time |
| Title | Energy Aware Scheduling for Unrelated Parallel Machines |
| URI | https://ieeexplore.ieee.org/document/6468361 |
| WOSCitedRecordID | wos000316905100074&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07TwMxDI5KxcAEqEVAAWVg5Nq7Sy5ORoRaMUBVCYq6VXk4gISu6NrC3-eSvhhY2BJPcazIjv19NiHXGpnRGYhEKpsmXKNJjEFIgBcFoHfMxKY-Lw8wHMrJRI0a5GbLhUHECD7DbljGWr6b2WVIlfUEF5KFv84egFhxtXb5lFAiU0XkbgkI-HQhNi2d1vtsU6ZMVS-iWuonF8BdeTcMWfs1XCX6lsHh_051RNo7kh4dbd3PMWlg2SLQj1w-evutK6RPtUVcgJq_0jo2peMyMlfQ0ZGuwgyVD_oYsZQ4b5PxoP98d5-sZyMkb3mqFonJ6kjfe2RaeWEBCgNeWak4N6mTeW0C63PujQQvU6-lFJnOpJOulnslkJ2QZjkr8ZRQm4IvmKk9WRGKbExaCE6dm8JLra09I62g9PRz1f5iutb3_G9xhxyEK13R9S5Ic1Et8ZLs26_F-7y6ijb7AenXlRY |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LTwIxEG4ImuhJDRjf9uDRwj76PBoDwQiERDDcSNudqglZzAL6992Wlwcv3to5dTppZjrzfTMI3WlIjY4FJ1LZiFANhhgDggjKmACXpSY09Xntin5fjsdqUEH3Wy4MAATwGTT8MtTys5ld-lRZk1MuU__X2WOUJtGKrbXLqPgimWKBvcWFR6hzvmnqtN7Hm0JlpJoB11I-Og_vShp-zNqv8SrBu7SP_neuY1Tf0fTwYOuATlAF8hoSrcDmww_fugD8Utok82DzN1xGp3iUB-4KZHigCz9FZYp7AU0J8zoatVvDxw5ZT0cg70mkFsTEZazvHKRaOW6FYEY4ZaWi1ESZTEojWJdQZ6RwMnJaSh7rWGYyK-VOcUhPUTWf5XCGsI2EY6kpfRnzZbZUWuHdOjXMSa2tPUc1r_Tkc9UAY7LW9-Jv8S066Ax73Un3qf98iQ799a7Ie1eouiiWcI327dfiY17cBPv9AOFjmF0 |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2012+IEEE%2FACM+International+Conference+on+Green+Computing+and+Communications&rft.atitle=Energy+Aware+Scheduling+for+Unrelated+Parallel+Machines&rft.au=Angel%2C+E.&rft.au=Bampis%2C+E.&rft.au=Kacem%2C+F.&rft.date=2012-11-01&rft.pub=IEEE&rft.isbn=9781467351461&rft.spage=533&rft.epage=540&rft_id=info:doi/10.1109%2FGreenCom.2012.78&rft.externalDocID=6468361 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781467351461/lc.gif&client=summon&freeimage=true |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781467351461/mc.gif&client=summon&freeimage=true |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781467351461/sc.gif&client=summon&freeimage=true |