Single-Bit Distributed Equality-Constraint Optimal Scheduling and Allocation Article Swipe
Mohammadreza Doostmohammadian
,
Hamid R. Rabiee
·
YOU?
·
· 2025
· Open Access
·
· DOI: https://doi.org/10.21203/rs.3.rs-6189692/v1
YOU?
·
· 2025
· Open Access
·
· DOI: https://doi.org/10.21203/rs.3.rs-6189692/v1
Distributed resource allocation finds applications in multi-agent-based networked scheduling scenarios. In this work, a single-bit solution is proposed for distributed resource allocation to optimize strictly convex cost functions. The main contribution is that the proposed solution only requires the exchange of single-bit of (local) gradient information. This significantly reduces the computational complexity and communication load on agents. The solution further preserves anytime feasibility over weight-balanced directed graphs, which ensures that the equality-constraint (between resource and demand) is always met. This implies that at any termination time the allocated resources are equal to the demand and there is no service disruption. Due to the reduced order of information exchange and complexity, the proposed single-bit algorithm converges to the neighborhood of the optimal solution. The general Lyapunov-based proof technique (i) is regardless of this particular sign-based nonlinearity and (ii) holds under weak network connectivity (uniform-connectivity, i.e., connectivity of the union network over time). Further, the solution solves general (possibly) non-quadratic objectives including additive penalty terms (and barrier functions) to address the local box constraints approximations. The algorithm works over weight-balanced networks, relaxing the need for iterative stochastic weight design, e.g., in case of link failure or packet drops. Applications in power resource allocation and CPU scheduling are simulated to verify the theoretical results.
Related Topics
Concepts
Metadata
- Type
- preprint
- Language
- en
- Landing Page
- https://doi.org/10.21203/rs.3.rs-6189692/v1
- https://www.researchsquare.com/article/rs-6189692/latest.pdf
- OA Status
- gold
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W4408415428
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W4408415428Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.21203/rs.3.rs-6189692/v1Digital Object Identifier
- Title
-
Single-Bit Distributed Equality-Constraint Optimal Scheduling and AllocationWork title
- Type
-
preprintOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2025Year of publication
- Publication date
-
2025-03-13Full publication date if available
- Authors
-
Mohammadreza Doostmohammadian, Hamid R. RabieeList of authors in order
- Landing page
-
https://doi.org/10.21203/rs.3.rs-6189692/v1Publisher landing page
- PDF URL
-
https://www.researchsquare.com/article/rs-6189692/latest.pdfDirect link to full text PDF
- Open access
-
YesWhether a free full text is available
- OA status
-
goldOpen access status per OpenAlex
- OA URL
-
https://www.researchsquare.com/article/rs-6189692/latest.pdfDirect OA link when available
- Concepts
-
Computer science, Scheduling (production processes), Constraint (computer-aided design), Bit (key), Distributed computing, Mathematical optimization, Mathematics, Computer network, GeometryTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
0Total citation count in OpenAlex
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W4408415428 |
|---|---|
| doi | https://doi.org/10.21203/rs.3.rs-6189692/v1 |
| ids.doi | https://doi.org/10.21203/rs.3.rs-6189692/v1 |
| ids.openalex | https://openalex.org/W4408415428 |
| fwci | 0.0 |
| type | preprint |
| title | Single-Bit Distributed Equality-Constraint Optimal Scheduling and Allocation |
| biblio.issue | |
| biblio.volume | |
| biblio.last_page | |
| biblio.first_page | |
| topics[0].id | https://openalex.org/T10551 |
| topics[0].field.id | https://openalex.org/fields/22 |
| topics[0].field.display_name | Engineering |
| topics[0].score | 0.9902999997138977 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/2209 |
| topics[0].subfield.display_name | Industrial and Manufacturing Engineering |
| topics[0].display_name | Scheduling and Optimization Algorithms |
| topics[1].id | https://openalex.org/T10715 |
| topics[1].field.id | https://openalex.org/fields/17 |
| topics[1].field.display_name | Computer Science |
| topics[1].score | 0.9656999707221985 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/1705 |
| topics[1].subfield.display_name | Computer Networks and Communications |
| topics[1].display_name | Distributed and Parallel Computing Systems |
| topics[2].id | https://openalex.org/T12288 |
| topics[2].field.id | https://openalex.org/fields/17 |
| topics[2].field.display_name | Computer Science |
| topics[2].score | 0.949400007724762 |
| 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 | Optimization and Search Problems |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C41008148 |
| concepts[0].level | 0 |
| concepts[0].score | 0.6618310809135437 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[0].display_name | Computer science |
| concepts[1].id | https://openalex.org/C206729178 |
| concepts[1].level | 2 |
| concepts[1].score | 0.6419621706008911 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q2271896 |
| concepts[1].display_name | Scheduling (production processes) |
| concepts[2].id | https://openalex.org/C2776036281 |
| concepts[2].level | 2 |
| concepts[2].score | 0.4787282645702362 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q48769818 |
| concepts[2].display_name | Constraint (computer-aided design) |
| concepts[3].id | https://openalex.org/C117011727 |
| concepts[3].level | 2 |
| concepts[3].score | 0.4772493839263916 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q1278488 |
| concepts[3].display_name | Bit (key) |
| concepts[4].id | https://openalex.org/C120314980 |
| concepts[4].level | 1 |
| concepts[4].score | 0.4293978214263916 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q180634 |
| concepts[4].display_name | Distributed computing |
| concepts[5].id | https://openalex.org/C126255220 |
| concepts[5].level | 1 |
| concepts[5].score | 0.3865746259689331 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q141495 |
| concepts[5].display_name | Mathematical optimization |
| concepts[6].id | https://openalex.org/C33923547 |
| concepts[6].level | 0 |
| concepts[6].score | 0.20849508047103882 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q395 |
| concepts[6].display_name | Mathematics |
| concepts[7].id | https://openalex.org/C31258907 |
| concepts[7].level | 1 |
| concepts[7].score | 0.18814170360565186 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q1301371 |
| concepts[7].display_name | Computer network |
| concepts[8].id | https://openalex.org/C2524010 |
| concepts[8].level | 1 |
| concepts[8].score | 0.0 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q8087 |
| concepts[8].display_name | Geometry |
| keywords[0].id | https://openalex.org/keywords/computer-science |
| keywords[0].score | 0.6618310809135437 |
| keywords[0].display_name | Computer science |
| keywords[1].id | https://openalex.org/keywords/scheduling |
| keywords[1].score | 0.6419621706008911 |
| keywords[1].display_name | Scheduling (production processes) |
| keywords[2].id | https://openalex.org/keywords/constraint |
| keywords[2].score | 0.4787282645702362 |
| keywords[2].display_name | Constraint (computer-aided design) |
| keywords[3].id | https://openalex.org/keywords/bit |
| keywords[3].score | 0.4772493839263916 |
| keywords[3].display_name | Bit (key) |
| keywords[4].id | https://openalex.org/keywords/distributed-computing |
| keywords[4].score | 0.4293978214263916 |
| keywords[4].display_name | Distributed computing |
| keywords[5].id | https://openalex.org/keywords/mathematical-optimization |
| keywords[5].score | 0.3865746259689331 |
| keywords[5].display_name | Mathematical optimization |
| keywords[6].id | https://openalex.org/keywords/mathematics |
| keywords[6].score | 0.20849508047103882 |
| keywords[6].display_name | Mathematics |
| keywords[7].id | https://openalex.org/keywords/computer-network |
| keywords[7].score | 0.18814170360565186 |
| keywords[7].display_name | Computer network |
| language | en |
| locations[0].id | doi:10.21203/rs.3.rs-6189692/v1 |
| locations[0].is_oa | True |
| locations[0].source | |
| locations[0].license | cc-by |
| locations[0].pdf_url | https://www.researchsquare.com/article/rs-6189692/latest.pdf |
| locations[0].version | acceptedVersion |
| locations[0].raw_type | posted-content |
| locations[0].license_id | https://openalex.org/licenses/cc-by |
| locations[0].is_accepted | True |
| locations[0].is_published | False |
| locations[0].raw_source_name | |
| locations[0].landing_page_url | https://doi.org/10.21203/rs.3.rs-6189692/v1 |
| indexed_in | crossref |
| authorships[0].author.id | https://openalex.org/A5085550621 |
| authorships[0].author.orcid | https://orcid.org/0000-0003-0959-6608 |
| authorships[0].author.display_name | Mohammadreza Doostmohammadian |
| authorships[0].countries | IR |
| authorships[0].affiliations[0].institution_ids | https://openalex.org/I928334797 |
| authorships[0].affiliations[0].raw_affiliation_string | Semnan University |
| authorships[0].institutions[0].id | https://openalex.org/I928334797 |
| authorships[0].institutions[0].ror | https://ror.org/029gksw03 |
| authorships[0].institutions[0].type | education |
| authorships[0].institutions[0].lineage | https://openalex.org/I928334797 |
| authorships[0].institutions[0].country_code | IR |
| authorships[0].institutions[0].display_name | Semnan University |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | mohammadreza Doostmohammadian |
| authorships[0].is_corresponding | False |
| authorships[0].raw_affiliation_strings | Semnan University |
| authorships[1].author.id | https://openalex.org/A5063512925 |
| authorships[1].author.orcid | https://orcid.org/0000-0002-9835-4493 |
| authorships[1].author.display_name | Hamid R. Rabiee |
| authorships[1].countries | IR |
| authorships[1].affiliations[0].institution_ids | https://openalex.org/I133529467 |
| authorships[1].affiliations[0].raw_affiliation_string | Sharif University of Technology |
| authorships[1].institutions[0].id | https://openalex.org/I133529467 |
| authorships[1].institutions[0].ror | https://ror.org/024c2fq17 |
| authorships[1].institutions[0].type | education |
| authorships[1].institutions[0].lineage | https://openalex.org/I133529467 |
| authorships[1].institutions[0].country_code | IR |
| authorships[1].institutions[0].display_name | Sharif University of Technology |
| authorships[1].author_position | last |
| authorships[1].raw_author_name | Hamid R. Rabiee |
| authorships[1].is_corresponding | False |
| authorships[1].raw_affiliation_strings | Sharif University of Technology |
| has_content.pdf | True |
| has_content.grobid_xml | False |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://www.researchsquare.com/article/rs-6189692/latest.pdf |
| open_access.oa_status | gold |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | Single-Bit Distributed Equality-Constraint Optimal Scheduling and Allocation |
| has_fulltext | False |
| is_retracted | False |
| updated_date | 2025-11-18T23:42:31.664661 |
| primary_topic.id | https://openalex.org/T10551 |
| primary_topic.field.id | https://openalex.org/fields/22 |
| primary_topic.field.display_name | Engineering |
| primary_topic.score | 0.9902999997138977 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/2209 |
| primary_topic.subfield.display_name | Industrial and Manufacturing Engineering |
| primary_topic.display_name | Scheduling and Optimization Algorithms |
| related_works | https://openalex.org/W4327546585, https://openalex.org/W2411923897, https://openalex.org/W4394546135, https://openalex.org/W4285347720, https://openalex.org/W4200259850, https://openalex.org/W2333831899, https://openalex.org/W2484894494, https://openalex.org/W2367385042, https://openalex.org/W4381186982, https://openalex.org/W2349580982 |
| cited_by_count | 0 |
| locations_count | 1 |
| best_oa_location.id | doi:10.21203/rs.3.rs-6189692/v1 |
| best_oa_location.is_oa | True |
| best_oa_location.source | |
| best_oa_location.license | cc-by |
| best_oa_location.pdf_url | https://www.researchsquare.com/article/rs-6189692/latest.pdf |
| best_oa_location.version | acceptedVersion |
| best_oa_location.raw_type | posted-content |
| best_oa_location.license_id | https://openalex.org/licenses/cc-by |
| best_oa_location.is_accepted | True |
| best_oa_location.is_published | False |
| best_oa_location.raw_source_name | |
| best_oa_location.landing_page_url | https://doi.org/10.21203/rs.3.rs-6189692/v1 |
| primary_location.id | doi:10.21203/rs.3.rs-6189692/v1 |
| primary_location.is_oa | True |
| primary_location.source | |
| primary_location.license | cc-by |
| primary_location.pdf_url | https://www.researchsquare.com/article/rs-6189692/latest.pdf |
| primary_location.version | acceptedVersion |
| primary_location.raw_type | posted-content |
| primary_location.license_id | https://openalex.org/licenses/cc-by |
| primary_location.is_accepted | True |
| primary_location.is_published | False |
| primary_location.raw_source_name | |
| primary_location.landing_page_url | https://doi.org/10.21203/rs.3.rs-6189692/v1 |
| publication_date | 2025-03-13 |
| publication_year | 2025 |
| referenced_works_count | 0 |
| abstract_inverted_index.a | 14 |
| abstract_inverted_index.In | 11 |
| abstract_inverted_index.at | 83 |
| abstract_inverted_index.in | 6, 189, 198 |
| abstract_inverted_index.is | 17, 32, 77, 97, 129 |
| abstract_inverted_index.no | 98 |
| abstract_inverted_index.of | 41, 43, 106, 119, 131, 146, 191 |
| abstract_inverted_index.on | 56 |
| abstract_inverted_index.or | 194 |
| abstract_inverted_index.to | 23, 92, 102, 116, 167, 207 |
| abstract_inverted_index.(i) | 128 |
| abstract_inverted_index.CPU | 203 |
| abstract_inverted_index.Due | 101 |
| abstract_inverted_index.The | 29, 58, 123, 174 |
| abstract_inverted_index.and | 53, 75, 95, 109, 136, 202 |
| abstract_inverted_index.any | 84 |
| abstract_inverted_index.are | 90, 205 |
| abstract_inverted_index.box | 171 |
| abstract_inverted_index.for | 19, 183 |
| abstract_inverted_index.the | 34, 39, 50, 71, 87, 93, 103, 111, 117, 120, 147, 153, 169, 181, 209 |
| abstract_inverted_index.(and | 164 |
| abstract_inverted_index.(ii) | 137 |
| abstract_inverted_index.This | 47, 80 |
| abstract_inverted_index.case | 190 |
| abstract_inverted_index.cost | 27 |
| abstract_inverted_index.link | 192 |
| abstract_inverted_index.load | 55 |
| abstract_inverted_index.main | 30 |
| abstract_inverted_index.met. | 79 |
| abstract_inverted_index.need | 182 |
| abstract_inverted_index.only | 37 |
| abstract_inverted_index.over | 64, 150, 177 |
| abstract_inverted_index.that | 33, 70, 82 |
| abstract_inverted_index.this | 12, 132 |
| abstract_inverted_index.time | 86 |
| abstract_inverted_index.weak | 140 |
| abstract_inverted_index.e.g., | 188 |
| abstract_inverted_index.equal | 91 |
| abstract_inverted_index.finds | 4 |
| abstract_inverted_index.holds | 138 |
| abstract_inverted_index.i.e., | 144 |
| abstract_inverted_index.local | 170 |
| abstract_inverted_index.order | 105 |
| abstract_inverted_index.power | 199 |
| abstract_inverted_index.proof | 126 |
| abstract_inverted_index.terms | 163 |
| abstract_inverted_index.there | 96 |
| abstract_inverted_index.under | 139 |
| abstract_inverted_index.union | 148 |
| abstract_inverted_index.which | 68 |
| abstract_inverted_index.work, | 13 |
| abstract_inverted_index.works | 176 |
| abstract_inverted_index.always | 78 |
| abstract_inverted_index.convex | 26 |
| abstract_inverted_index.demand | 94 |
| abstract_inverted_index.drops. | 196 |
| abstract_inverted_index.packet | 195 |
| abstract_inverted_index.solves | 155 |
| abstract_inverted_index.time). | 151 |
| abstract_inverted_index.verify | 208 |
| abstract_inverted_index.weight | 186 |
| abstract_inverted_index.(local) | 44 |
| abstract_inverted_index.address | 168 |
| abstract_inverted_index.agents. | 57 |
| abstract_inverted_index.anytime | 62 |
| abstract_inverted_index.barrier | 165 |
| abstract_inverted_index.demand) | 76 |
| abstract_inverted_index.design, | 187 |
| abstract_inverted_index.ensures | 69 |
| abstract_inverted_index.failure | 193 |
| abstract_inverted_index.further | 60 |
| abstract_inverted_index.general | 124, 156 |
| abstract_inverted_index.graphs, | 67 |
| abstract_inverted_index.implies | 81 |
| abstract_inverted_index.network | 141, 149 |
| abstract_inverted_index.optimal | 121 |
| abstract_inverted_index.penalty | 162 |
| abstract_inverted_index.reduced | 104 |
| abstract_inverted_index.reduces | 49 |
| abstract_inverted_index.service | 99 |
| abstract_inverted_index.(between | 73 |
| abstract_inverted_index.Further, | 152 |
| abstract_inverted_index.additive | 161 |
| abstract_inverted_index.directed | 66 |
| abstract_inverted_index.exchange | 40, 108 |
| abstract_inverted_index.gradient | 45 |
| abstract_inverted_index.optimize | 24 |
| abstract_inverted_index.proposed | 18, 35, 112 |
| abstract_inverted_index.relaxing | 180 |
| abstract_inverted_index.requires | 38 |
| abstract_inverted_index.resource | 2, 21, 74, 200 |
| abstract_inverted_index.results. | 211 |
| abstract_inverted_index.solution | 16, 36, 59, 154 |
| abstract_inverted_index.strictly | 25 |
| abstract_inverted_index.algorithm | 114, 175 |
| abstract_inverted_index.allocated | 88 |
| abstract_inverted_index.converges | 115 |
| abstract_inverted_index.including | 160 |
| abstract_inverted_index.iterative | 184 |
| abstract_inverted_index.networked | 8 |
| abstract_inverted_index.networks, | 179 |
| abstract_inverted_index.preserves | 61 |
| abstract_inverted_index.resources | 89 |
| abstract_inverted_index.simulated | 206 |
| abstract_inverted_index.solution. | 122 |
| abstract_inverted_index.technique | 127 |
| abstract_inverted_index.(possibly) | 157 |
| abstract_inverted_index.allocation | 3, 22, 201 |
| abstract_inverted_index.complexity | 52 |
| abstract_inverted_index.functions) | 166 |
| abstract_inverted_index.functions. | 28 |
| abstract_inverted_index.objectives | 159 |
| abstract_inverted_index.particular | 133 |
| abstract_inverted_index.regardless | 130 |
| abstract_inverted_index.scenarios. | 10 |
| abstract_inverted_index.scheduling | 9, 204 |
| abstract_inverted_index.sign-based | 134 |
| abstract_inverted_index.single-bit | 15, 42, 113 |
| abstract_inverted_index.stochastic | 185 |
| abstract_inverted_index.Distributed | 1 |
| abstract_inverted_index.complexity, | 110 |
| abstract_inverted_index.constraints | 172 |
| abstract_inverted_index.disruption. | 100 |
| abstract_inverted_index.distributed | 20 |
| abstract_inverted_index.feasibility | 63 |
| abstract_inverted_index.information | 107 |
| abstract_inverted_index.termination | 85 |
| abstract_inverted_index.theoretical | 210 |
| abstract_inverted_index.Applications | 197 |
| abstract_inverted_index.applications | 5 |
| abstract_inverted_index.connectivity | 142, 145 |
| abstract_inverted_index.contribution | 31 |
| abstract_inverted_index.information. | 46 |
| abstract_inverted_index.neighborhood | 118 |
| abstract_inverted_index.nonlinearity | 135 |
| abstract_inverted_index.communication | 54 |
| abstract_inverted_index.computational | 51 |
| abstract_inverted_index.non-quadratic | 158 |
| abstract_inverted_index.significantly | 48 |
| abstract_inverted_index.Lyapunov-based | 125 |
| abstract_inverted_index.approximations. | 173 |
| abstract_inverted_index.weight-balanced | 65, 178 |
| abstract_inverted_index.multi-agent-based | 7 |
| abstract_inverted_index.equality-constraint | 72 |
| abstract_inverted_index.(uniform-connectivity, | 143 |
| abstract_inverted_index.<title>Abstract</title> | 0 |
| cited_by_percentile_year | |
| countries_distinct_count | 1 |
| institutions_distinct_count | 2 |
| citation_normalized_percentile.value | 0.09330796 |
| citation_normalized_percentile.is_in_top_1_percent | False |
| citation_normalized_percentile.is_in_top_10_percent | False |