Dynamic priority assignment based task scheduling for battery-powered portable systems

In battery-powered portable devices, the most important design goal is maximizing the battery lifetime. This paper proposes a battery-aware task scheduling algorithm with dynamic priority assignment (DPA) to extend battery lifetime. Experiments show that compared with traditional task scheduling alg...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	Yufeng Xie, Muhua Han, Leibo Liu, Rui Dai, Shaojun Wei
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Batteries Capacitors Costs Dynamic scheduling Microelectronics Mobile computing Portable computers Processor scheduling Scheduling algorithm Wireless communication
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

container_end_page	212
container_issue
container_start_page	209
container_title
container_volume
creator	Yufeng Xie Muhua Han Leibo Liu Rui Dai Shaojun Wei
description	In battery-powered portable devices, the most important design goal is maximizing the battery lifetime. This paper proposes a battery-aware task scheduling algorithm with dynamic priority assignment (DPA) to extend battery lifetime. Experiments show that compared with traditional task scheduling algorithms with static priority assignment (SPA), the proposed algorithm efficiently reduces battery cost (by up to 20.23%) and extends battery lifetime. Also, the proposed algorithm reduces complexity by average 37.45% and 4.6% compared with the most classical two SPA-based algorithms.
doi_str_mv	10.1109/ICASIC.2007.4415604
format	Conference Proceeding
fullrecord	<record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_4415604</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4415604</ieee_id><sourcerecordid>4415604</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-6051ec9ac8287ccb01666d7d53dadd1dd41d6317001372ca331e696fe5dff64e3</originalsourceid><addsrcrecordid>eNpFkNtKAzEQhuMJrLVP0Ju8wK6ZHLuXUk-Fghce8K6kyWyN7qEkEdm3d8GiV8Pw_fzMN4TMgZUArLpaLa-fVsuSM2ZKKUFpJo_IBUg-LiC4OSYTDpoXRqm3k38A1ekfkHBOZil9MMaAmarSZkJeb4bOtsHRfQx9DHmgNqWw61rsMt3ahJ5mmz5pcu_ov5rQ7Wjdx5HkjHEo9v03xjGz72O22wZpGlLGNl2Ss9o2CWeHOSUvd7fPy4di_Xg_mqyLAEblQjMF6CrrFnxhnNsy0Fp745Xw1nvwXoLXAsx4sDDcWSEAdaVrVL6utUQxJfPf3oCIm9GhtXHYHP4jfgDnaldt</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Dynamic priority assignment based task scheduling for battery-powered portable systems</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Yufeng Xie ; Muhua Han ; Leibo Liu ; Rui Dai ; Shaojun Wei</creator><creatorcontrib>Yufeng Xie ; Muhua Han ; Leibo Liu ; Rui Dai ; Shaojun Wei</creatorcontrib><description>In battery-powered portable devices, the most important design goal is maximizing the battery lifetime. This paper proposes a battery-aware task scheduling algorithm with dynamic priority assignment (DPA) to extend battery lifetime. Experiments show that compared with traditional task scheduling algorithms with static priority assignment (SPA), the proposed algorithm efficiently reduces battery cost (by up to 20.23%) and extends battery lifetime. Also, the proposed algorithm reduces complexity by average 37.45% and 4.6% compared with the most classical two SPA-based algorithms.</description><identifier>ISSN: 2162-7541</identifier><identifier>ISBN: 1424411319</identifier><identifier>ISBN: 9781424411313</identifier><identifier>EISSN: 2162-755X</identifier><identifier>EISBN: 1424411327</identifier><identifier>EISBN: 9781424411320</identifier><identifier>DOI: 10.1109/ICASIC.2007.4415604</identifier><language>eng</language><publisher>IEEE</publisher><subject>Batteries ; Capacitors ; Costs ; Dynamic scheduling ; Microelectronics ; Mobile computing ; Portable computers ; Processor scheduling ; Scheduling algorithm ; Wireless communication</subject><ispartof>2007 7th International Conference on ASIC, 2007, p.209-212</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/4415604$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2052,27902,54895</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4415604$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Yufeng Xie</creatorcontrib><creatorcontrib>Muhua Han</creatorcontrib><creatorcontrib>Leibo Liu</creatorcontrib><creatorcontrib>Rui Dai</creatorcontrib><creatorcontrib>Shaojun Wei</creatorcontrib><title>Dynamic priority assignment based task scheduling for battery-powered portable systems</title><title>2007 7th International Conference on ASIC</title><addtitle>ICASIC</addtitle><description>In battery-powered portable devices, the most important design goal is maximizing the battery lifetime. This paper proposes a battery-aware task scheduling algorithm with dynamic priority assignment (DPA) to extend battery lifetime. Experiments show that compared with traditional task scheduling algorithms with static priority assignment (SPA), the proposed algorithm efficiently reduces battery cost (by up to 20.23%) and extends battery lifetime. Also, the proposed algorithm reduces complexity by average 37.45% and 4.6% compared with the most classical two SPA-based algorithms.</description><subject>Batteries</subject><subject>Capacitors</subject><subject>Costs</subject><subject>Dynamic scheduling</subject><subject>Microelectronics</subject><subject>Mobile computing</subject><subject>Portable computers</subject><subject>Processor scheduling</subject><subject>Scheduling algorithm</subject><subject>Wireless communication</subject><issn>2162-7541</issn><issn>2162-755X</issn><isbn>1424411319</isbn><isbn>9781424411313</isbn><isbn>1424411327</isbn><isbn>9781424411320</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2007</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNpFkNtKAzEQhuMJrLVP0Ju8wK6ZHLuXUk-Fghce8K6kyWyN7qEkEdm3d8GiV8Pw_fzMN4TMgZUArLpaLa-fVsuSM2ZKKUFpJo_IBUg-LiC4OSYTDpoXRqm3k38A1ekfkHBOZil9MMaAmarSZkJeb4bOtsHRfQx9DHmgNqWw61rsMt3ahJ5mmz5pcu_ov5rQ7Wjdx5HkjHEo9v03xjGz72O22wZpGlLGNl2Ss9o2CWeHOSUvd7fPy4di_Xg_mqyLAEblQjMF6CrrFnxhnNsy0Fp745Xw1nvwXoLXAsx4sDDcWSEAdaVrVL6utUQxJfPf3oCIm9GhtXHYHP4jfgDnaldt</recordid><startdate>200710</startdate><enddate>200710</enddate><creator>Yufeng Xie</creator><creator>Muhua Han</creator><creator>Leibo Liu</creator><creator>Rui Dai</creator><creator>Shaojun Wei</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>200710</creationdate><title>Dynamic priority assignment based task scheduling for battery-powered portable systems</title><author>Yufeng Xie ; Muhua Han ; Leibo Liu ; Rui Dai ; Shaojun Wei</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-6051ec9ac8287ccb01666d7d53dadd1dd41d6317001372ca331e696fe5dff64e3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2007</creationdate><topic>Batteries</topic><topic>Capacitors</topic><topic>Costs</topic><topic>Dynamic scheduling</topic><topic>Microelectronics</topic><topic>Mobile computing</topic><topic>Portable computers</topic><topic>Processor scheduling</topic><topic>Scheduling algorithm</topic><topic>Wireless communication</topic><toplevel>online_resources</toplevel><creatorcontrib>Yufeng Xie</creatorcontrib><creatorcontrib>Muhua Han</creatorcontrib><creatorcontrib>Leibo Liu</creatorcontrib><creatorcontrib>Rui Dai</creatorcontrib><creatorcontrib>Shaojun Wei</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Yufeng Xie</au><au>Muhua Han</au><au>Leibo Liu</au><au>Rui Dai</au><au>Shaojun Wei</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Dynamic priority assignment based task scheduling for battery-powered portable systems</atitle><btitle>2007 7th International Conference on ASIC</btitle><stitle>ICASIC</stitle><date>2007-10</date><risdate>2007</risdate><spage>209</spage><epage>212</epage><pages>209-212</pages><issn>2162-7541</issn><eissn>2162-755X</eissn><isbn>1424411319</isbn><isbn>9781424411313</isbn><eisbn>1424411327</eisbn><eisbn>9781424411320</eisbn><abstract>In battery-powered portable devices, the most important design goal is maximizing the battery lifetime. This paper proposes a battery-aware task scheduling algorithm with dynamic priority assignment (DPA) to extend battery lifetime. Experiments show that compared with traditional task scheduling algorithms with static priority assignment (SPA), the proposed algorithm efficiently reduces battery cost (by up to 20.23%) and extends battery lifetime. Also, the proposed algorithm reduces complexity by average 37.45% and 4.6% compared with the most classical two SPA-based algorithms.</abstract><pub>IEEE</pub><doi>10.1109/ICASIC.2007.4415604</doi><tpages>4</tpages></addata></record>
fulltext	fulltext_linktorsrc
identifier	ISSN: 2162-7541
ispartof	2007 7th International Conference on ASIC, 2007, p.209-212
issn	2162-7541 2162-755X
language	eng
recordid	cdi_ieee_primary_4415604
source	IEEE Electronic Library (IEL) Conference Proceedings
subjects	Batteries Capacitors Costs Dynamic scheduling Microelectronics Mobile computing Portable computers Processor scheduling Scheduling algorithm Wireless communication
title	Dynamic priority assignment based task scheduling for battery-powered portable systems
url	https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-08T14%3A54%3A16IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Dynamic%20priority%20assignment%20based%20task%20scheduling%20for%20battery-powered%20portable%20systems&rft.btitle=2007%207th%20International%20Conference%20on%20ASIC&rft.au=Yufeng%20Xie&rft.date=2007-10&rft.spage=209&rft.epage=212&rft.pages=209-212&rft.issn=2162-7541&rft.eissn=2162-755X&rft.isbn=1424411319&rft.isbn_list=9781424411313&rft_id=info:doi/10.1109/ICASIC.2007.4415604&rft_dat=%3Cieee_6IE%3E4415604%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=1424411327&rft.eisbn_list=9781424411320&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=4415604&rfr_iscdi=true