Robust control of an M/G/1 processor sharing queue with applications to energy management Article Swipe
Tuan Van Dinh
,
Lachlan L. H. Andrew
,
Yoni Nazarathy
·
YOU?
·
· 2024
· Open Access
·
· DOI: https://doi.org/10.25916/sut.26294422
YOU?
·
· 2024
· Open Access
·
· DOI: https://doi.org/10.25916/sut.26294422
The Internet contains many devices that must process multiple jobs at the same time. For many purposes, such devices can be modelled as M/G/1-PS queues. This report investigates such a queue. We consider single-pass, lossless, queueing systems at steady-state subject to Poisson job arrivals at an unknown rate. Service rates are in general allowed to depend on the number of jobs in the system, i.e. speed-scaling. A general goal is to control the state dependent service rates such that both energy consumption and delay are kept low. As there is a tradeoff between the two, a sensible performance measure is a linear combination of the mean job delay and energy consumption, where power is generally assumed to be an increasing polynomial function of the speed. We consider both the ''architecture'' of the system, which we define as a specification of the number of speeds that the system can choose from, and the ''design'' of the system, which we define as the actual speeds available. Previous work has illustrated, that when the arrival rate is precisely known, there is little benefit in introducing complex (multi-speed) architectures, yet in view of parameter uncertainty, allowing a variable number of speeds improves robustness. In the current report, we numerically quantify the tradeoffs of architecture specification with respect to robustness.
Related Topics
Concepts
Metadata
- Type
- article
- Language
- en
- Landing Page
- http://hdl.handle.net/1959.3/217978
- OA Status
- green
- Cited By
- 1
- References
- 12
- Related Works
- 20
- OpenAlex ID
- https://openalex.org/W2279200158
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W2279200158Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.25916/sut.26294422Digital Object Identifier
- Title
-
Robust control of an M/G/1 processor sharing queue with applications to energy managementWork title
- Type
-
articleOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2024Year of publication
- Publication date
-
2024-01-01Full publication date if available
- Authors
-
Tuan Van Dinh, Lachlan L. H. Andrew, Yoni NazarathyList of authors in order
- Landing page
-
https://hdl.handle.net/1959.3/217978Publisher landing page
- Open access
-
YesWhether a free full text is available
- OA status
-
greenOpen access status per OpenAlex
- Concepts
-
Queue, Computer science, Energy consumption, Queueing theory, Processor sharing, Robustness (evolution), Mathematical optimization, Mathematics, Computer network, Engineering, Biochemistry, Chemistry, Electrical engineering, GeneTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
1Total citation count in OpenAlex
- Citations by year (recent)
-
2012: 1Per-year citation counts (last 5 years)
- References (count)
-
12Number of works referenced by this work
- Related works (count)
-
20Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W2279200158 |
|---|---|
| doi | https://doi.org/10.25916/sut.26294422 |
| ids.doi | https://doi.org/10.25916/sut.26294422 |
| ids.mag | 2279200158 |
| ids.openalex | https://openalex.org/W2279200158 |
| fwci | |
| type | article |
| title | Robust control of an M/G/1 processor sharing queue with applications to energy management |
| biblio.issue | |
| biblio.volume | |
| biblio.last_page | |
| biblio.first_page | |
| topics[0].id | https://openalex.org/T10974 |
| topics[0].field.id | https://openalex.org/fields/14 |
| topics[0].field.display_name | Business, Management and Accounting |
| topics[0].score | 0.9997000098228455 |
| topics[0].domain.id | https://openalex.org/domains/2 |
| topics[0].domain.display_name | Social Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/1404 |
| topics[0].subfield.display_name | Management Information Systems |
| topics[0].display_name | Advanced Queuing Theory Analysis |
| topics[1].id | https://openalex.org/T11409 |
| topics[1].field.id | https://openalex.org/fields/22 |
| topics[1].field.display_name | Engineering |
| topics[1].score | 0.9957000017166138 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/2208 |
| topics[1].subfield.display_name | Electrical and Electronic Engineering |
| topics[1].display_name | Advanced Wireless Network Optimization |
| topics[2].id | https://openalex.org/T13553 |
| topics[2].field.id | https://openalex.org/fields/17 |
| topics[2].field.display_name | Computer Science |
| topics[2].score | 0.9943000078201294 |
| topics[2].domain.id | https://openalex.org/domains/3 |
| topics[2].domain.display_name | Physical Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/1705 |
| topics[2].subfield.display_name | Computer Networks and Communications |
| topics[2].display_name | Age of Information Optimization |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C160403385 |
| concepts[0].level | 2 |
| concepts[0].score | 0.6597557067871094 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q220543 |
| concepts[0].display_name | Queue |
| concepts[1].id | https://openalex.org/C41008148 |
| concepts[1].level | 0 |
| concepts[1].score | 0.6575484871864319 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[1].display_name | Computer science |
| concepts[2].id | https://openalex.org/C2780165032 |
| concepts[2].level | 2 |
| concepts[2].score | 0.5215780138969421 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q16869822 |
| concepts[2].display_name | Energy consumption |
| concepts[3].id | https://openalex.org/C22684755 |
| concepts[3].level | 2 |
| concepts[3].score | 0.5164811611175537 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q847526 |
| concepts[3].display_name | Queueing theory |
| concepts[4].id | https://openalex.org/C2779084733 |
| concepts[4].level | 3 |
| concepts[4].score | 0.5113579630851746 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q17097343 |
| concepts[4].display_name | Processor sharing |
| concepts[5].id | https://openalex.org/C63479239 |
| concepts[5].level | 3 |
| concepts[5].score | 0.49900150299072266 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q7353546 |
| concepts[5].display_name | Robustness (evolution) |
| concepts[6].id | https://openalex.org/C126255220 |
| concepts[6].level | 1 |
| concepts[6].score | 0.3956097364425659 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q141495 |
| concepts[6].display_name | Mathematical optimization |
| concepts[7].id | https://openalex.org/C33923547 |
| concepts[7].level | 0 |
| concepts[7].score | 0.1890963613986969 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q395 |
| concepts[7].display_name | Mathematics |
| concepts[8].id | https://openalex.org/C31258907 |
| concepts[8].level | 1 |
| concepts[8].score | 0.16932550072669983 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q1301371 |
| concepts[8].display_name | Computer network |
| concepts[9].id | https://openalex.org/C127413603 |
| concepts[9].level | 0 |
| concepts[9].score | 0.10308271646499634 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q11023 |
| concepts[9].display_name | Engineering |
| concepts[10].id | https://openalex.org/C55493867 |
| concepts[10].level | 1 |
| concepts[10].score | 0.0 |
| concepts[10].wikidata | https://www.wikidata.org/wiki/Q7094 |
| concepts[10].display_name | Biochemistry |
| concepts[11].id | https://openalex.org/C185592680 |
| concepts[11].level | 0 |
| concepts[11].score | 0.0 |
| concepts[11].wikidata | https://www.wikidata.org/wiki/Q2329 |
| concepts[11].display_name | Chemistry |
| concepts[12].id | https://openalex.org/C119599485 |
| concepts[12].level | 1 |
| concepts[12].score | 0.0 |
| concepts[12].wikidata | https://www.wikidata.org/wiki/Q43035 |
| concepts[12].display_name | Electrical engineering |
| concepts[13].id | https://openalex.org/C104317684 |
| concepts[13].level | 2 |
| concepts[13].score | 0.0 |
| concepts[13].wikidata | https://www.wikidata.org/wiki/Q7187 |
| concepts[13].display_name | Gene |
| keywords[0].id | https://openalex.org/keywords/queue |
| keywords[0].score | 0.6597557067871094 |
| keywords[0].display_name | Queue |
| keywords[1].id | https://openalex.org/keywords/computer-science |
| keywords[1].score | 0.6575484871864319 |
| keywords[1].display_name | Computer science |
| keywords[2].id | https://openalex.org/keywords/energy-consumption |
| keywords[2].score | 0.5215780138969421 |
| keywords[2].display_name | Energy consumption |
| keywords[3].id | https://openalex.org/keywords/queueing-theory |
| keywords[3].score | 0.5164811611175537 |
| keywords[3].display_name | Queueing theory |
| keywords[4].id | https://openalex.org/keywords/processor-sharing |
| keywords[4].score | 0.5113579630851746 |
| keywords[4].display_name | Processor sharing |
| keywords[5].id | https://openalex.org/keywords/robustness |
| keywords[5].score | 0.49900150299072266 |
| keywords[5].display_name | Robustness (evolution) |
| keywords[6].id | https://openalex.org/keywords/mathematical-optimization |
| keywords[6].score | 0.3956097364425659 |
| keywords[6].display_name | Mathematical optimization |
| keywords[7].id | https://openalex.org/keywords/mathematics |
| keywords[7].score | 0.1890963613986969 |
| keywords[7].display_name | Mathematics |
| keywords[8].id | https://openalex.org/keywords/computer-network |
| keywords[8].score | 0.16932550072669983 |
| keywords[8].display_name | Computer network |
| keywords[9].id | https://openalex.org/keywords/engineering |
| keywords[9].score | 0.10308271646499634 |
| keywords[9].display_name | Engineering |
| language | en |
| locations[0].id | pmh:oai:researchbank.swinburne.edu.au:106d9a80-11bb-4c31-94d2-aa8ed9ec0e5b/1 |
| locations[0].is_oa | False |
| locations[0].source.id | https://openalex.org/S4306401157 |
| locations[0].source.issn | |
| locations[0].source.type | repository |
| locations[0].source.is_oa | False |
| locations[0].source.issn_l | |
| locations[0].source.is_core | False |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | Swinburne Research Bank (Swinburne University of Technology) |
| locations[0].source.host_organization | https://openalex.org/I57093077 |
| locations[0].source.host_organization_name | Swinburne University of Technology |
| locations[0].source.host_organization_lineage | https://openalex.org/I57093077 |
| locations[0].license | |
| locations[0].pdf_url | |
| locations[0].version | acceptedVersion |
| locations[0].raw_type | |
| locations[0].license_id | |
| locations[0].is_accepted | True |
| locations[0].is_published | False |
| locations[0].raw_source_name | Centre for Advanced Internet Architectures: technical reports, No. 120226A (Feb 2012) |
| locations[0].landing_page_url | http://hdl.handle.net/1959.3/217978 |
| locations[1].id | pmh:oai:CiteSeerX.psu:10.1.1.452.3263 |
| locations[1].is_oa | False |
| locations[1].source | |
| locations[1].license | |
| locations[1].pdf_url | |
| locations[1].version | submittedVersion |
| locations[1].raw_type | text |
| locations[1].license_id | |
| locations[1].is_accepted | False |
| locations[1].is_published | False |
| locations[1].raw_source_name | http://caia.swin.edu.au/reports/120226A/CAIA-TR-120226A.pdf |
| locations[1].landing_page_url | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.452.3263 |
| locations[2].id | pmh:oai:figshare.com:article/26294422 |
| locations[2].is_oa | True |
| locations[2].source.id | https://openalex.org/S4306400572 |
| locations[2].source.issn | |
| locations[2].source.type | repository |
| locations[2].source.is_oa | False |
| locations[2].source.issn_l | |
| locations[2].source.is_core | False |
| locations[2].source.is_in_doaj | False |
| locations[2].source.display_name | OPAL (Open@LaTrobe) (La Trobe University) |
| locations[2].source.host_organization | https://openalex.org/I196829312 |
| locations[2].source.host_organization_name | La Trobe University |
| locations[2].source.host_organization_lineage | https://openalex.org/I196829312 |
| locations[2].license | |
| locations[2].pdf_url | |
| locations[2].version | submittedVersion |
| locations[2].raw_type | Text |
| locations[2].license_id | |
| locations[2].is_accepted | False |
| locations[2].is_published | False |
| locations[2].raw_source_name | |
| locations[2].landing_page_url | |
| locations[3].id | mag:2279200158 |
| locations[3].is_oa | False |
| locations[3].source | |
| locations[3].license | |
| locations[3].pdf_url | |
| locations[3].version | |
| locations[3].raw_type | |
| locations[3].license_id | |
| locations[3].is_accepted | False |
| locations[3].is_published | |
| locations[3].raw_source_name | |
| locations[3].landing_page_url | http://caia.swin.edu.au/reports/120226A/CAIA-TR-120226A.pdf |
| locations[4].id | doi:10.25916/sut.26294422 |
| locations[4].is_oa | True |
| locations[4].source.id | https://openalex.org/S4306401157 |
| locations[4].source.issn | |
| locations[4].source.type | repository |
| locations[4].source.is_oa | False |
| locations[4].source.issn_l | |
| locations[4].source.is_core | False |
| locations[4].source.is_in_doaj | False |
| locations[4].source.display_name | Swinburne Research Bank (Swinburne University of Technology) |
| locations[4].source.host_organization | https://openalex.org/I57093077 |
| locations[4].source.host_organization_name | Swinburne University of Technology |
| locations[4].source.host_organization_lineage | https://openalex.org/I57093077 |
| locations[4].license | |
| locations[4].pdf_url | |
| locations[4].version | |
| locations[4].raw_type | report |
| locations[4].license_id | |
| locations[4].is_accepted | False |
| locations[4].is_published | |
| locations[4].raw_source_name | |
| locations[4].landing_page_url | https://doi.org/10.25916/sut.26294422 |
| locations[5].id | doi:10.25916/sut.26294422.v1 |
| locations[5].is_oa | True |
| locations[5].source.id | https://openalex.org/S4306401157 |
| locations[5].source.issn | |
| locations[5].source.type | repository |
| locations[5].source.is_oa | False |
| locations[5].source.issn_l | |
| locations[5].source.is_core | False |
| locations[5].source.is_in_doaj | False |
| locations[5].source.display_name | Swinburne Research Bank (Swinburne University of Technology) |
| locations[5].source.host_organization | https://openalex.org/I57093077 |
| locations[5].source.host_organization_name | Swinburne University of Technology |
| locations[5].source.host_organization_lineage | https://openalex.org/I57093077 |
| locations[5].license | |
| locations[5].pdf_url | |
| locations[5].version | |
| locations[5].raw_type | report |
| locations[5].license_id | |
| locations[5].is_accepted | False |
| locations[5].is_published | |
| locations[5].raw_source_name | |
| locations[5].landing_page_url | https://doi.org/10.25916/sut.26294422.v1 |
| indexed_in | datacite |
| authorships[0].author.id | https://openalex.org/A5079773412 |
| authorships[0].author.orcid | |
| authorships[0].author.display_name | Tuan Van Dinh |
| authorships[0].countries | AU |
| authorships[0].affiliations[0].institution_ids | https://openalex.org/I57093077 |
| authorships[0].affiliations[0].raw_affiliation_string | Swinburne Univ. of Technology#TAB# |
| authorships[0].institutions[0].id | https://openalex.org/I57093077 |
| authorships[0].institutions[0].ror | https://ror.org/031rekg67 |
| authorships[0].institutions[0].type | education |
| authorships[0].institutions[0].lineage | https://openalex.org/I57093077 |
| authorships[0].institutions[0].country_code | AU |
| authorships[0].institutions[0].display_name | Swinburne University of Technology |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Tuan Dinh |
| authorships[0].is_corresponding | False |
| authorships[0].raw_affiliation_strings | Swinburne Univ. of Technology#TAB# |
| authorships[1].author.id | https://openalex.org/A5011921013 |
| authorships[1].author.orcid | https://orcid.org/0000-0003-0267-1062 |
| authorships[1].author.display_name | Lachlan L. H. Andrew |
| authorships[1].countries | AU |
| authorships[1].affiliations[0].institution_ids | https://openalex.org/I57093077 |
| authorships[1].affiliations[0].raw_affiliation_string | Swinburne Univ. of Technology#TAB# |
| authorships[1].institutions[0].id | https://openalex.org/I57093077 |
| authorships[1].institutions[0].ror | https://ror.org/031rekg67 |
| authorships[1].institutions[0].type | education |
| authorships[1].institutions[0].lineage | https://openalex.org/I57093077 |
| authorships[1].institutions[0].country_code | AU |
| authorships[1].institutions[0].display_name | Swinburne University of Technology |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | Lachlan L. H. Andrew |
| authorships[1].is_corresponding | False |
| authorships[1].raw_affiliation_strings | Swinburne Univ. of Technology#TAB# |
| authorships[2].author.id | https://openalex.org/A5070445330 |
| authorships[2].author.orcid | https://orcid.org/0000-0003-3071-8462 |
| authorships[2].author.display_name | Yoni Nazarathy |
| authorships[2].countries | AU |
| authorships[2].affiliations[0].institution_ids | https://openalex.org/I57093077 |
| authorships[2].affiliations[0].raw_affiliation_string | Swinburne Univ. of Technology#TAB# |
| authorships[2].institutions[0].id | https://openalex.org/I57093077 |
| authorships[2].institutions[0].ror | https://ror.org/031rekg67 |
| authorships[2].institutions[0].type | education |
| authorships[2].institutions[0].lineage | https://openalex.org/I57093077 |
| authorships[2].institutions[0].country_code | AU |
| authorships[2].institutions[0].display_name | Swinburne University of Technology |
| authorships[2].author_position | last |
| authorships[2].raw_author_name | Yoni Nazarathy |
| authorships[2].is_corresponding | False |
| authorships[2].raw_affiliation_strings | Swinburne Univ. of Technology#TAB# |
| has_content.pdf | False |
| has_content.grobid_xml | False |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | |
| open_access.oa_status | green |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | Robust control of an M/G/1 processor sharing queue with applications to energy management |
| has_fulltext | True |
| is_retracted | False |
| updated_date | 2025-11-06T06:51:31.235846 |
| primary_topic.id | https://openalex.org/T10974 |
| primary_topic.field.id | https://openalex.org/fields/14 |
| primary_topic.field.display_name | Business, Management and Accounting |
| primary_topic.score | 0.9997000098228455 |
| primary_topic.domain.id | https://openalex.org/domains/2 |
| primary_topic.domain.display_name | Social Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/1404 |
| primary_topic.subfield.display_name | Management Information Systems |
| primary_topic.display_name | Advanced Queuing Theory Analysis |
| related_works | https://openalex.org/W2146621738, https://openalex.org/W2914075294, https://openalex.org/W3196180943, https://openalex.org/W2886673086, https://openalex.org/W3107624746, https://openalex.org/W2959296410, https://openalex.org/W2470297717, https://openalex.org/W1982816132, https://openalex.org/W2095742300, https://openalex.org/W2099410350, https://openalex.org/W2018852485, https://openalex.org/W2188389890, https://openalex.org/W3021961287, https://openalex.org/W2972515856, https://openalex.org/W2996754155, https://openalex.org/W2002811760, https://openalex.org/W2063509488, https://openalex.org/W2226309728, https://openalex.org/W1561885472, https://openalex.org/W2745769920 |
| cited_by_count | 1 |
| counts_by_year[0].year | 2012 |
| counts_by_year[0].cited_by_count | 1 |
| locations_count | 6 |
| best_oa_location.id | pmh:oai:figshare.com:article/26294422 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S4306400572 |
| best_oa_location.source.issn | |
| best_oa_location.source.type | repository |
| best_oa_location.source.is_oa | False |
| best_oa_location.source.issn_l | |
| best_oa_location.source.is_core | False |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | OPAL (Open@LaTrobe) (La Trobe University) |
| best_oa_location.source.host_organization | https://openalex.org/I196829312 |
| best_oa_location.source.host_organization_name | La Trobe University |
| best_oa_location.source.host_organization_lineage | https://openalex.org/I196829312 |
| best_oa_location.license | |
| best_oa_location.pdf_url | |
| best_oa_location.version | submittedVersion |
| best_oa_location.raw_type | Text |
| best_oa_location.license_id | |
| best_oa_location.is_accepted | False |
| best_oa_location.is_published | False |
| best_oa_location.raw_source_name | |
| best_oa_location.landing_page_url | |
| primary_location.id | pmh:oai:researchbank.swinburne.edu.au:106d9a80-11bb-4c31-94d2-aa8ed9ec0e5b/1 |
| primary_location.is_oa | False |
| primary_location.source.id | https://openalex.org/S4306401157 |
| primary_location.source.issn | |
| primary_location.source.type | repository |
| primary_location.source.is_oa | False |
| primary_location.source.issn_l | |
| primary_location.source.is_core | False |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | Swinburne Research Bank (Swinburne University of Technology) |
| primary_location.source.host_organization | https://openalex.org/I57093077 |
| primary_location.source.host_organization_name | Swinburne University of Technology |
| primary_location.source.host_organization_lineage | https://openalex.org/I57093077 |
| primary_location.license | |
| primary_location.pdf_url | |
| primary_location.version | acceptedVersion |
| primary_location.raw_type | |
| primary_location.license_id | |
| primary_location.is_accepted | True |
| primary_location.is_published | False |
| primary_location.raw_source_name | Centre for Advanced Internet Architectures: technical reports, No. 120226A (Feb 2012) |
| primary_location.landing_page_url | http://hdl.handle.net/1959.3/217978 |
| publication_date | 2024-01-01 |
| publication_year | 2024 |
| referenced_works | https://openalex.org/W208066780, https://openalex.org/W2034039215, https://openalex.org/W2112694890, https://openalex.org/W2137105579, https://openalex.org/W2799087070, https://openalex.org/W2109341366, https://openalex.org/W2152575945, https://openalex.org/W2053491613, https://openalex.org/W2177261686, https://openalex.org/W2798766386, https://openalex.org/W2153919611, https://openalex.org/W1979500760 |
| referenced_works_count | 12 |
| abstract_inverted_index.A | 66 |
| abstract_inverted_index.a | 29, 90, 95, 100, 137, 192 |
| abstract_inverted_index.As | 87 |
| abstract_inverted_index.In | 199 |
| abstract_inverted_index.We | 31, 125 |
| abstract_inverted_index.an | 45, 118 |
| abstract_inverted_index.as | 22, 136, 159 |
| abstract_inverted_index.at | 10, 37, 44 |
| abstract_inverted_index.be | 20, 117 |
| abstract_inverted_index.in | 51, 61, 180, 186 |
| abstract_inverted_index.is | 69, 89, 99, 113, 173, 177 |
| abstract_inverted_index.of | 59, 103, 122, 130, 139, 142, 153, 188, 195, 208 |
| abstract_inverted_index.on | 56 |
| abstract_inverted_index.to | 40, 54, 70, 116, 213 |
| abstract_inverted_index.we | 134, 157, 203 |
| abstract_inverted_index.For | 14 |
| abstract_inverted_index.The | 0 |
| abstract_inverted_index.and | 82, 108, 150 |
| abstract_inverted_index.are | 50, 84 |
| abstract_inverted_index.can | 19, 147 |
| abstract_inverted_index.has | 166 |
| abstract_inverted_index.job | 42, 106 |
| abstract_inverted_index.the | 11, 57, 62, 72, 93, 104, 123, 128, 131, 140, 145, 151, 154, 160, 170, 200, 206 |
| abstract_inverted_index.yet | 185 |
| abstract_inverted_index.This | 25 |
| abstract_inverted_index.both | 79, 127 |
| abstract_inverted_index.goal | 68 |
| abstract_inverted_index.i.e. | 64 |
| abstract_inverted_index.jobs | 9, 60 |
| abstract_inverted_index.kept | 85 |
| abstract_inverted_index.low. | 86 |
| abstract_inverted_index.many | 3, 15 |
| abstract_inverted_index.mean | 105 |
| abstract_inverted_index.must | 6 |
| abstract_inverted_index.rate | 172 |
| abstract_inverted_index.same | 12 |
| abstract_inverted_index.such | 17, 28, 77 |
| abstract_inverted_index.that | 5, 78, 144, 168 |
| abstract_inverted_index.two, | 94 |
| abstract_inverted_index.view | 187 |
| abstract_inverted_index.when | 169 |
| abstract_inverted_index.with | 211 |
| abstract_inverted_index.work | 165 |
| abstract_inverted_index.delay | 83, 107 |
| abstract_inverted_index.from, | 149 |
| abstract_inverted_index.power | 112 |
| abstract_inverted_index.rate. | 47 |
| abstract_inverted_index.rates | 49, 76 |
| abstract_inverted_index.state | 73 |
| abstract_inverted_index.there | 88, 176 |
| abstract_inverted_index.time. | 13 |
| abstract_inverted_index.where | 111 |
| abstract_inverted_index.which | 133, 156 |
| abstract_inverted_index.actual | 161 |
| abstract_inverted_index.choose | 148 |
| abstract_inverted_index.define | 135, 158 |
| abstract_inverted_index.depend | 55 |
| abstract_inverted_index.energy | 80, 109 |
| abstract_inverted_index.known, | 175 |
| abstract_inverted_index.linear | 101 |
| abstract_inverted_index.little | 178 |
| abstract_inverted_index.number | 58, 141, 194 |
| abstract_inverted_index.queue. | 30 |
| abstract_inverted_index.report | 26 |
| abstract_inverted_index.speed. | 124 |
| abstract_inverted_index.speeds | 143, 162, 196 |
| abstract_inverted_index.system | 146 |
| abstract_inverted_index.Poisson | 41 |
| abstract_inverted_index.Service | 48 |
| abstract_inverted_index.allowed | 53 |
| abstract_inverted_index.arrival | 171 |
| abstract_inverted_index.assumed | 115 |
| abstract_inverted_index.benefit | 179 |
| abstract_inverted_index.between | 92 |
| abstract_inverted_index.complex | 182 |
| abstract_inverted_index.control | 71 |
| abstract_inverted_index.current | 201 |
| abstract_inverted_index.devices | 4, 18 |
| abstract_inverted_index.general | 52, 67 |
| abstract_inverted_index.measure | 98 |
| abstract_inverted_index.process | 7 |
| abstract_inverted_index.queues. | 24 |
| abstract_inverted_index.report, | 202 |
| abstract_inverted_index.respect | 212 |
| abstract_inverted_index.service | 75 |
| abstract_inverted_index.subject | 39 |
| abstract_inverted_index.system, | 63, 132, 155 |
| abstract_inverted_index.systems | 36 |
| abstract_inverted_index.unknown | 46 |
| abstract_inverted_index.Internet | 1 |
| abstract_inverted_index.M/G/1-PS | 23 |
| abstract_inverted_index.Previous | 164 |
| abstract_inverted_index.allowing | 191 |
| abstract_inverted_index.arrivals | 43 |
| abstract_inverted_index.consider | 32, 126 |
| abstract_inverted_index.contains | 2 |
| abstract_inverted_index.function | 121 |
| abstract_inverted_index.improves | 197 |
| abstract_inverted_index.modelled | 21 |
| abstract_inverted_index.multiple | 8 |
| abstract_inverted_index.quantify | 205 |
| abstract_inverted_index.queueing | 35 |
| abstract_inverted_index.sensible | 96 |
| abstract_inverted_index.tradeoff | 91 |
| abstract_inverted_index.variable | 193 |
| abstract_inverted_index.dependent | 74 |
| abstract_inverted_index.generally | 114 |
| abstract_inverted_index.lossless, | 34 |
| abstract_inverted_index.parameter | 189 |
| abstract_inverted_index.precisely | 174 |
| abstract_inverted_index.purposes, | 16 |
| abstract_inverted_index.tradeoffs | 207 |
| abstract_inverted_index.''design'' | 152 |
| abstract_inverted_index.available. | 163 |
| abstract_inverted_index.increasing | 119 |
| abstract_inverted_index.polynomial | 120 |
| abstract_inverted_index.combination | 102 |
| abstract_inverted_index.consumption | 81 |
| abstract_inverted_index.introducing | 181 |
| abstract_inverted_index.numerically | 204 |
| abstract_inverted_index.performance | 97 |
| abstract_inverted_index.robustness. | 198, 214 |
| abstract_inverted_index.architecture | 209 |
| abstract_inverted_index.consumption, | 110 |
| abstract_inverted_index.illustrated, | 167 |
| abstract_inverted_index.investigates | 27 |
| abstract_inverted_index.single-pass, | 33 |
| abstract_inverted_index.steady-state | 38 |
| abstract_inverted_index.uncertainty, | 190 |
| abstract_inverted_index.(multi-speed) | 183 |
| abstract_inverted_index.specification | 138, 210 |
| abstract_inverted_index.architectures, | 184 |
| abstract_inverted_index.speed-scaling. | 65 |
| abstract_inverted_index.''architecture'' | 129 |
| cited_by_percentile_year | |
| countries_distinct_count | 1 |
| institutions_distinct_count | 3 |
| sustainable_development_goals[0].id | https://metadata.un.org/sdg/7 |
| sustainable_development_goals[0].score | 0.8999999761581421 |
| sustainable_development_goals[0].display_name | Affordable and clean energy |
| citation_normalized_percentile |