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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2012 IEEE/ACM International Conference on Green Computing and Communications s. 533 - 540
Hlavní autoři: Angel, E., Bampis, E., Kacem, F.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.11.2012
Témata:
approximation algorithm
Approximation algorithms
Approximation methods
Computational modeling
Energy consumption
Polynomials
Program processors
randomization
Schedules
scheduling
unrelated machines
weighted completion time
ISBN:9781467351461, 1467351466
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
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 Proceedings Order Plan All Online (POP All Online) 1998-present by volume
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.5750295
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/eLvHCXMwlV1LTwMhECa18eBJTWt8h4NHaXdZFoajMW08aNNEm_TWsMugJmZrtlv9-wJ9efDiDSYcGCaEGeb7Zgi5EUoYKU3KfDhRMMETxzS3OTMWElECpgJjdf1HNRrBdKrHLXK75cIgYgSfYS8MYy7fzstl-CrrSyEhC7HOnlJyxdXa_aeEFJnOI3dLqoBPl3JT0mk9TzdpykT3I6rFX7kA7uK90GTtV3OV-LYMD_-3qyPS3ZH06Hj7_ByTFlYdogaRy0fvvk2N9NlbxAao-Sv1vimdVJG5gpaOTR16qHzQp4ilxEWXTIaDl_sHtu6NwN54ohtWpN7Tdw4zo50slcoL5XQJWogiscANZqXjwhWgHCTOAMjUpGDBernTErMT0q7mFZ4SyhXkFqWFHDNh_SrhQzawyvuOGVdSnpFOUHr2uSp_MVvre_63-IIchCNd0fUuSbupl3hF9suv5n1RX0eb_QC_2ZO2
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEA6lCnpSacW3OXh0291sNpkcRVoqtqVgC72V7GaigrSybfXvm6QvD168JUMIeRAyj--bIeSOS66F0EnkzIk84iy2kWImi7SBmBeACceQXb8r-30Yj9WgQu63XBhEDOAzbPhmiOWbWbH0rrKm4AJSb-vsZdxNu2Jr7TwqPkimssDeEtIj1IXYJHVa95NNoDJWzYBrcY_Ow7tYw5dZ-1VeJfwu7aP_reuY1Hc0PTrYfkAnpILTGpGtwOajD9-6RPri7sR4sPkrddopHU0DdwUNHejSV1H5oL2ApsR5nYzareFjJ1pXR4jeWKwWUZ44Xd9aTLWyopAyy6VVBSjO89gA05gWlnGbg7QQWw0gEp2AAePkVglMT0l1OpviGaFMQmZQGMgw5caN4s5oAyOd9pgyKcQ5qflNTz5XCTAm6_1e_C2-JQedYa876T71ny_JoT_eFXnvilQX5RKvyX7xtXiflzfh_n4ApOmW_Q
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