Loading…
Amalgamated Intermittent Computing Systems
Intermittent computing systems undergo frequent power failure, hindering necessary data sample capture or timely on-device computation. These missing samples and deadlines limit the potential usage of intermittent computing systems in many time-sensitive and fault-tolerant applications. However, a g...
Saved in:
Published in: | arXiv.org 2023-03 |
---|---|
Main Authors: | , , |
Format: | Article |
Language: | English |
Subjects: | |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | |
---|---|
cites | |
container_end_page | |
container_issue | |
container_start_page | |
container_title | arXiv.org |
container_volume | |
creator | Islam, Bashima Luo, Yubo Nirjon, Shahriar |
description | Intermittent computing systems undergo frequent power failure, hindering necessary data sample capture or timely on-device computation. These missing samples and deadlines limit the potential usage of intermittent computing systems in many time-sensitive and fault-tolerant applications. However, a group/swarm of intermittent nodes may amalgamate to sense and process all the samples by taking turns in waking up and extending their collective on-time. However, coordinating a swarm of intermittent computing nodes requires frequent and power-hungry communication, often infeasible with limited energy. Though previous works have shown promises when all intermittent nodes have access to the same amount of energy to harvest, work has yet to be looked into scenarios when the available energy distribution is different for each node. The proposed AICS framework provides an amalgamated intermittent computing system where each node schedules its wake-up schedules based on the duty cycle without communication overhead. We propose one offline tailored duty cycle selection method (Prime-Co-Prime), which schedules wake-up and sleep cycles for each node based on the measured energy to harvest for each node and the prior knowledge or estimation regarding the relative energy distribution. However, when the energy is variable, the problem is formulated as a Decentralized-Partially Observable Markov Decision Process (Dec-POMDP). Each node uses a group of heuristics to solve the Dec-POMDP and schedule its wake-up cycle. |
doi_str_mv | 10.48550/arxiv.2303.13000 |
format | article |
fullrecord | <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2790193649</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2790193649</sourcerecordid><originalsourceid>FETCH-LOGICAL-a529-15dc175a6dfcc46398e00da05271c74b584f5e496f8ab7e65c37a92a55a4f6d03</originalsourceid><addsrcrecordid>eNotjctqwzAQAEWhkJDmA3oz5Fawu9JqJesYTB-BQA7NPWxsOThEdmrJpf37BtrTwBxmhHiUUOiSCJ55_O6-CoWAhUQAuBNzhSjzUis1E8sYzzepjFVEOBdP68CXEwdOvsk2ffJj6FLyfcqqIVyn1PWn7OMnJh_ig7hv-RL98p8LsX992Vfv-Xb3tqnW25xJuVxSU0tLbJq2rrVBV3qAhoGUlbXVRyp1S14705Z8tN5QjZadYiLWrWkAF2L1l72Ow-fkYzqch2nsb8eDsg6kQ6Md_gJiNULo</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2790193649</pqid></control><display><type>article</type><title>Amalgamated Intermittent Computing Systems</title><source>Publicly Available Content (ProQuest)</source><creator>Islam, Bashima ; Luo, Yubo ; Nirjon, Shahriar</creator><creatorcontrib>Islam, Bashima ; Luo, Yubo ; Nirjon, Shahriar</creatorcontrib><description>Intermittent computing systems undergo frequent power failure, hindering necessary data sample capture or timely on-device computation. These missing samples and deadlines limit the potential usage of intermittent computing systems in many time-sensitive and fault-tolerant applications. However, a group/swarm of intermittent nodes may amalgamate to sense and process all the samples by taking turns in waking up and extending their collective on-time. However, coordinating a swarm of intermittent computing nodes requires frequent and power-hungry communication, often infeasible with limited energy. Though previous works have shown promises when all intermittent nodes have access to the same amount of energy to harvest, work has yet to be looked into scenarios when the available energy distribution is different for each node. The proposed AICS framework provides an amalgamated intermittent computing system where each node schedules its wake-up schedules based on the duty cycle without communication overhead. We propose one offline tailored duty cycle selection method (Prime-Co-Prime), which schedules wake-up and sleep cycles for each node based on the measured energy to harvest for each node and the prior knowledge or estimation regarding the relative energy distribution. However, when the energy is variable, the problem is formulated as a Decentralized-Partially Observable Markov Decision Process (Dec-POMDP). Each node uses a group of heuristics to solve the Dec-POMDP and schedule its wake-up cycle.</description><identifier>EISSN: 2331-8422</identifier><identifier>DOI: 10.48550/arxiv.2303.13000</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Amalgamation ; Energy ; Energy distribution ; Energy harvesting ; Fault tolerance ; Markov processes ; Nodes ; Schedules</subject><ispartof>arXiv.org, 2023-03</ispartof><rights>2023. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.proquest.com/docview/2790193649?pq-origsite=primo$$EHTML$$P50$$Gproquest$$Hfree_for_read</linktohtml><link.rule.ids>780,784,25751,27923,37010,44588</link.rule.ids></links><search><creatorcontrib>Islam, Bashima</creatorcontrib><creatorcontrib>Luo, Yubo</creatorcontrib><creatorcontrib>Nirjon, Shahriar</creatorcontrib><title>Amalgamated Intermittent Computing Systems</title><title>arXiv.org</title><description>Intermittent computing systems undergo frequent power failure, hindering necessary data sample capture or timely on-device computation. These missing samples and deadlines limit the potential usage of intermittent computing systems in many time-sensitive and fault-tolerant applications. However, a group/swarm of intermittent nodes may amalgamate to sense and process all the samples by taking turns in waking up and extending their collective on-time. However, coordinating a swarm of intermittent computing nodes requires frequent and power-hungry communication, often infeasible with limited energy. Though previous works have shown promises when all intermittent nodes have access to the same amount of energy to harvest, work has yet to be looked into scenarios when the available energy distribution is different for each node. The proposed AICS framework provides an amalgamated intermittent computing system where each node schedules its wake-up schedules based on the duty cycle without communication overhead. We propose one offline tailored duty cycle selection method (Prime-Co-Prime), which schedules wake-up and sleep cycles for each node based on the measured energy to harvest for each node and the prior knowledge or estimation regarding the relative energy distribution. However, when the energy is variable, the problem is formulated as a Decentralized-Partially Observable Markov Decision Process (Dec-POMDP). Each node uses a group of heuristics to solve the Dec-POMDP and schedule its wake-up cycle.</description><subject>Amalgamation</subject><subject>Energy</subject><subject>Energy distribution</subject><subject>Energy harvesting</subject><subject>Fault tolerance</subject><subject>Markov processes</subject><subject>Nodes</subject><subject>Schedules</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>PIMPY</sourceid><recordid>eNotjctqwzAQAEWhkJDmA3oz5Fawu9JqJesYTB-BQA7NPWxsOThEdmrJpf37BtrTwBxmhHiUUOiSCJ55_O6-CoWAhUQAuBNzhSjzUis1E8sYzzepjFVEOBdP68CXEwdOvsk2ffJj6FLyfcqqIVyn1PWn7OMnJh_ig7hv-RL98p8LsX992Vfv-Xb3tqnW25xJuVxSU0tLbJq2rrVBV3qAhoGUlbXVRyp1S14705Z8tN5QjZadYiLWrWkAF2L1l72Ow-fkYzqch2nsb8eDsg6kQ6Md_gJiNULo</recordid><startdate>20230323</startdate><enddate>20230323</enddate><creator>Islam, Bashima</creator><creator>Luo, Yubo</creator><creator>Nirjon, Shahriar</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20230323</creationdate><title>Amalgamated Intermittent Computing Systems</title><author>Islam, Bashima ; Luo, Yubo ; Nirjon, Shahriar</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a529-15dc175a6dfcc46398e00da05271c74b584f5e496f8ab7e65c37a92a55a4f6d03</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Amalgamation</topic><topic>Energy</topic><topic>Energy distribution</topic><topic>Energy harvesting</topic><topic>Fault tolerance</topic><topic>Markov processes</topic><topic>Nodes</topic><topic>Schedules</topic><toplevel>online_resources</toplevel><creatorcontrib>Islam, Bashima</creatorcontrib><creatorcontrib>Luo, Yubo</creatorcontrib><creatorcontrib>Nirjon, Shahriar</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>ProQuest Central Essentials</collection><collection>AUTh Library subscriptions: ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content (ProQuest)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering collection</collection><jtitle>arXiv.org</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Islam, Bashima</au><au>Luo, Yubo</au><au>Nirjon, Shahriar</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Amalgamated Intermittent Computing Systems</atitle><jtitle>arXiv.org</jtitle><date>2023-03-23</date><risdate>2023</risdate><eissn>2331-8422</eissn><abstract>Intermittent computing systems undergo frequent power failure, hindering necessary data sample capture or timely on-device computation. These missing samples and deadlines limit the potential usage of intermittent computing systems in many time-sensitive and fault-tolerant applications. However, a group/swarm of intermittent nodes may amalgamate to sense and process all the samples by taking turns in waking up and extending their collective on-time. However, coordinating a swarm of intermittent computing nodes requires frequent and power-hungry communication, often infeasible with limited energy. Though previous works have shown promises when all intermittent nodes have access to the same amount of energy to harvest, work has yet to be looked into scenarios when the available energy distribution is different for each node. The proposed AICS framework provides an amalgamated intermittent computing system where each node schedules its wake-up schedules based on the duty cycle without communication overhead. We propose one offline tailored duty cycle selection method (Prime-Co-Prime), which schedules wake-up and sleep cycles for each node based on the measured energy to harvest for each node and the prior knowledge or estimation regarding the relative energy distribution. However, when the energy is variable, the problem is formulated as a Decentralized-Partially Observable Markov Decision Process (Dec-POMDP). Each node uses a group of heuristics to solve the Dec-POMDP and schedule its wake-up cycle.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><doi>10.48550/arxiv.2303.13000</doi><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | EISSN: 2331-8422 |
ispartof | arXiv.org, 2023-03 |
issn | 2331-8422 |
language | eng |
recordid | cdi_proquest_journals_2790193649 |
source | Publicly Available Content (ProQuest) |
subjects | Amalgamation Energy Energy distribution Energy harvesting Fault tolerance Markov processes Nodes Schedules |
title | Amalgamated Intermittent Computing Systems |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-13T17%3A24%3A30IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Amalgamated%20Intermittent%20Computing%20Systems&rft.jtitle=arXiv.org&rft.au=Islam,%20Bashima&rft.date=2023-03-23&rft.eissn=2331-8422&rft_id=info:doi/10.48550/arxiv.2303.13000&rft_dat=%3Cproquest%3E2790193649%3C/proquest%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-a529-15dc175a6dfcc46398e00da05271c74b584f5e496f8ab7e65c37a92a55a4f6d03%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2790193649&rft_id=info:pmid/&rfr_iscdi=true |