The Buffer Minimization Problem for Scheduling Flow Jobs with Conflicts Article Swipe
We consider the online buffer minimization in multiprocessor systems with conflicts problem (in short, the buffer minimization problem) in the recently introduced flow model. In an online fashion, workloads arrive on some of the $n$ processors and are stored in an input buffer. Processors can run and reduce these workloads, but conflicts between pairs of processors restrict simultaneous task execution. Conflicts are represented by a graph, where vertices correspond to processors and edges indicate conflicting pairs. An online algorithm must decide which processors are run at a time; so provide a valid schedule respecting the conflict constraints. The objective is to minimize the maximal workload observed across all processors during the schedule. Unlike the original model, where workloads arrive as discrete blocks at specific time points, the flow model assumes workloads arrive continuously over intervals or not at all. We present tight bounds for all graphs with four vertices (except the path, which has been solved previously) and for the families of general complete graphs and complete bipartite graphs. We also recover almost tight bounds for complete $k$-partite graphs. For the original model, we narrow the gap for the graph consisting of a triangle and an additional edge to a fourth vertex.
Related Topics
Concepts
Computer science
Minification
Multiprocessing
Bipartite graph
Scheduling (production processes)
Workload
Parallel computing
Schedule
Task (project management)
Multiprocessor scheduling
Online algorithm
Algorithm
Job shop scheduling
Mathematical optimization
Control flow graph
Maximum flow problem
Processor scheduling
Flow network
Flow (mathematics)
Multigraph
Enhanced Data Rates for GSM Evolution
Competitive analysis
Graph theory
Graph
Flow shop scheduling
Job scheduler
Upper and lower bounds
Distributed computing
Approximation algorithm
Metadata
- Type
- article
- Landing Page
- http://arxiv.org/abs/2511.19690
- https://arxiv.org/pdf/2511.19690
- OA Status
- green
- OpenAlex ID
- https://openalex.org/W7106861314
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W7106861314Canonical identifier for this work in OpenAlex
- Title
-
The Buffer Minimization Problem for Scheduling Flow Jobs with ConflictsWork title
- Type
-
articleOpenAlex work type
- Publication year
-
2025Year of publication
- Publication date
-
2025-11-24Full publication date if available
- Authors
-
Haas, Niklas, Schmitt, Sören, van Stee, RobList of authors in order
- Landing page
-
https://arxiv.org/abs/2511.19690Publisher landing page
- PDF URL
-
https://arxiv.org/pdf/2511.19690Direct link to full text PDF
- Open access
-
YesWhether a free full text is available
- OA status
-
greenOpen access status per OpenAlex
- OA URL
-
https://arxiv.org/pdf/2511.19690Direct OA link when available
- Concepts
-
Computer science, Minification, Multiprocessing, Bipartite graph, Scheduling (production processes), Workload, Parallel computing, Schedule, Task (project management), Multiprocessor scheduling, Online algorithm, Algorithm, Job shop scheduling, Mathematical optimization, Control flow graph, Maximum flow problem, Processor scheduling, Flow network, Flow (mathematics), Multigraph, Enhanced Data Rates for GSM Evolution, Competitive analysis, Graph theory, Graph, Flow shop scheduling, Job scheduler, Upper and lower bounds, Distributed computing, Approximation algorithmTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
0Total citation count in OpenAlex
Full payload
| id | https://openalex.org/W7106861314 |
|---|---|
| doi | |
| ids.openalex | https://openalex.org/W7106861314 |
| fwci | 0.0 |
| type | article |
| title | The Buffer Minimization Problem for Scheduling Flow Jobs with Conflicts |
| biblio.issue | |
| biblio.volume | |
| biblio.last_page | |
| biblio.first_page | |
| topics[0].id | https://openalex.org/T12288 |
| topics[0].field.id | https://openalex.org/fields/17 |
| topics[0].field.display_name | Computer Science |
| topics[0].score | 0.5266996622085571 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/1705 |
| topics[0].subfield.display_name | Computer Networks and Communications |
| topics[0].display_name | Optimization and Search Problems |
| topics[1].id | https://openalex.org/T10933 |
| topics[1].field.id | https://openalex.org/fields/17 |
| topics[1].field.display_name | Computer Science |
| topics[1].score | 0.13171949982643127 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/1708 |
| topics[1].subfield.display_name | Hardware and Architecture |
| topics[1].display_name | Real-Time Systems Scheduling |
| topics[2].id | https://openalex.org/T10715 |
| topics[2].field.id | https://openalex.org/fields/17 |
| topics[2].field.display_name | Computer Science |
| topics[2].score | 0.089474618434906 |
| 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 | Distributed and Parallel Computing Systems |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C41008148 |
| concepts[0].level | 0 |
| concepts[0].score | 0.6889001131057739 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[0].display_name | Computer science |
| concepts[1].id | https://openalex.org/C147764199 |
| concepts[1].level | 2 |
| concepts[1].score | 0.6807544827461243 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q6865248 |
| concepts[1].display_name | Minification |
| concepts[2].id | https://openalex.org/C4822641 |
| concepts[2].level | 2 |
| concepts[2].score | 0.6662382483482361 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q846651 |
| concepts[2].display_name | Multiprocessing |
| concepts[3].id | https://openalex.org/C197657726 |
| concepts[3].level | 3 |
| concepts[3].score | 0.6568052768707275 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q174733 |
| concepts[3].display_name | Bipartite graph |
| concepts[4].id | https://openalex.org/C206729178 |
| concepts[4].level | 2 |
| concepts[4].score | 0.6461484432220459 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q2271896 |
| concepts[4].display_name | Scheduling (production processes) |
| concepts[5].id | https://openalex.org/C2778476105 |
| concepts[5].level | 2 |
| concepts[5].score | 0.5681084394454956 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q628539 |
| concepts[5].display_name | Workload |
| concepts[6].id | https://openalex.org/C173608175 |
| concepts[6].level | 1 |
| concepts[6].score | 0.4592941105365753 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q232661 |
| concepts[6].display_name | Parallel computing |
| concepts[7].id | https://openalex.org/C68387754 |
| concepts[7].level | 2 |
| concepts[7].score | 0.43479493260383606 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q7271585 |
| concepts[7].display_name | Schedule |
| concepts[8].id | https://openalex.org/C2780451532 |
| concepts[8].level | 2 |
| concepts[8].score | 0.4288804829120636 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q759676 |
| concepts[8].display_name | Task (project management) |
| concepts[9].id | https://openalex.org/C85924588 |
| concepts[9].level | 5 |
| concepts[9].score | 0.4148019254207611 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q107419135 |
| concepts[9].display_name | Multiprocessor scheduling |
| concepts[10].id | https://openalex.org/C196921405 |
| concepts[10].level | 2 |
| concepts[10].score | 0.390392541885376 |
| concepts[10].wikidata | https://www.wikidata.org/wiki/Q786431 |
| concepts[10].display_name | Online algorithm |
| concepts[11].id | https://openalex.org/C11413529 |
| concepts[11].level | 1 |
| concepts[11].score | 0.37188920378685 |
| concepts[11].wikidata | https://www.wikidata.org/wiki/Q8366 |
| concepts[11].display_name | Algorithm |
| concepts[12].id | https://openalex.org/C55416958 |
| concepts[12].level | 3 |
| concepts[12].score | 0.36719927191734314 |
| concepts[12].wikidata | https://www.wikidata.org/wiki/Q6206757 |
| concepts[12].display_name | Job shop scheduling |
| concepts[13].id | https://openalex.org/C126255220 |
| concepts[13].level | 1 |
| concepts[13].score | 0.36614152789115906 |
| concepts[13].wikidata | https://www.wikidata.org/wiki/Q141495 |
| concepts[13].display_name | Mathematical optimization |
| concepts[14].id | https://openalex.org/C27458966 |
| concepts[14].level | 2 |
| concepts[14].score | 0.36201542615890503 |
| concepts[14].wikidata | https://www.wikidata.org/wiki/Q1187693 |
| concepts[14].display_name | Control flow graph |
| concepts[15].id | https://openalex.org/C157469704 |
| concepts[15].level | 2 |
| concepts[15].score | 0.3483385443687439 |
| concepts[15].wikidata | https://www.wikidata.org/wiki/Q2585642 |
| concepts[15].display_name | Maximum flow problem |
| concepts[16].id | https://openalex.org/C2984822820 |
| concepts[16].level | 3 |
| concepts[16].score | 0.34806665778160095 |
| concepts[16].wikidata | https://www.wikidata.org/wiki/Q1123036 |
| concepts[16].display_name | Processor scheduling |
| concepts[17].id | https://openalex.org/C114809511 |
| concepts[17].level | 2 |
| concepts[17].score | 0.3372332751750946 |
| concepts[17].wikidata | https://www.wikidata.org/wiki/Q1412924 |
| concepts[17].display_name | Flow network |
| concepts[18].id | https://openalex.org/C38349280 |
| concepts[18].level | 2 |
| concepts[18].score | 0.3232148587703705 |
| concepts[18].wikidata | https://www.wikidata.org/wiki/Q1434290 |
| concepts[18].display_name | Flow (mathematics) |
| concepts[19].id | https://openalex.org/C17758045 |
| concepts[19].level | 3 |
| concepts[19].score | 0.3137407898902893 |
| concepts[19].wikidata | https://www.wikidata.org/wiki/Q2642629 |
| concepts[19].display_name | Multigraph |
| concepts[20].id | https://openalex.org/C162307627 |
| concepts[20].level | 2 |
| concepts[20].score | 0.31298524141311646 |
| concepts[20].wikidata | https://www.wikidata.org/wiki/Q204833 |
| concepts[20].display_name | Enhanced Data Rates for GSM Evolution |
| concepts[21].id | https://openalex.org/C102408133 |
| concepts[21].level | 3 |
| concepts[21].score | 0.30931928753852844 |
| concepts[21].wikidata | https://www.wikidata.org/wiki/Q5156350 |
| concepts[21].display_name | Competitive analysis |
| concepts[22].id | https://openalex.org/C88230418 |
| concepts[22].level | 2 |
| concepts[22].score | 0.3000304698944092 |
| concepts[22].wikidata | https://www.wikidata.org/wiki/Q131476 |
| concepts[22].display_name | Graph theory |
| concepts[23].id | https://openalex.org/C132525143 |
| concepts[23].level | 2 |
| concepts[23].score | 0.29950782656669617 |
| concepts[23].wikidata | https://www.wikidata.org/wiki/Q141488 |
| concepts[23].display_name | Graph |
| concepts[24].id | https://openalex.org/C158336966 |
| concepts[24].level | 4 |
| concepts[24].score | 0.2909313142299652 |
| concepts[24].wikidata | https://www.wikidata.org/wiki/Q3074426 |
| concepts[24].display_name | Flow shop scheduling |
| concepts[25].id | https://openalex.org/C111873713 |
| concepts[25].level | 3 |
| concepts[25].score | 0.2894669771194458 |
| concepts[25].wikidata | https://www.wikidata.org/wiki/Q1641413 |
| concepts[25].display_name | Job scheduler |
| concepts[26].id | https://openalex.org/C77553402 |
| concepts[26].level | 2 |
| concepts[26].score | 0.28329402208328247 |
| concepts[26].wikidata | https://www.wikidata.org/wiki/Q13222579 |
| concepts[26].display_name | Upper and lower bounds |
| concepts[27].id | https://openalex.org/C120314980 |
| concepts[27].level | 1 |
| concepts[27].score | 0.27953824400901794 |
| concepts[27].wikidata | https://www.wikidata.org/wiki/Q180634 |
| concepts[27].display_name | Distributed computing |
| concepts[28].id | https://openalex.org/C148764684 |
| concepts[28].level | 2 |
| concepts[28].score | 0.275614857673645 |
| concepts[28].wikidata | https://www.wikidata.org/wiki/Q621751 |
| concepts[28].display_name | Approximation algorithm |
| keywords[0].id | https://openalex.org/keywords/minification |
| keywords[0].score | 0.6807544827461243 |
| keywords[0].display_name | Minification |
| keywords[1].id | https://openalex.org/keywords/multiprocessing |
| keywords[1].score | 0.6662382483482361 |
| keywords[1].display_name | Multiprocessing |
| keywords[2].id | https://openalex.org/keywords/bipartite-graph |
| keywords[2].score | 0.6568052768707275 |
| keywords[2].display_name | Bipartite graph |
| keywords[3].id | https://openalex.org/keywords/scheduling |
| keywords[3].score | 0.6461484432220459 |
| keywords[3].display_name | Scheduling (production processes) |
| keywords[4].id | https://openalex.org/keywords/workload |
| keywords[4].score | 0.5681084394454956 |
| keywords[4].display_name | Workload |
| keywords[5].id | https://openalex.org/keywords/schedule |
| keywords[5].score | 0.43479493260383606 |
| keywords[5].display_name | Schedule |
| keywords[6].id | https://openalex.org/keywords/task |
| keywords[6].score | 0.4288804829120636 |
| keywords[6].display_name | Task (project management) |
| keywords[7].id | https://openalex.org/keywords/multiprocessor-scheduling |
| keywords[7].score | 0.4148019254207611 |
| keywords[7].display_name | Multiprocessor scheduling |
| keywords[8].id | https://openalex.org/keywords/online-algorithm |
| keywords[8].score | 0.390392541885376 |
| keywords[8].display_name | Online algorithm |
| language | |
| locations[0].id | pmh:oai:arXiv.org:2511.19690 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S4306400194 |
| locations[0].source.issn | |
| locations[0].source.type | repository |
| locations[0].source.is_oa | True |
| locations[0].source.issn_l | |
| locations[0].source.is_core | False |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | arXiv (Cornell University) |
| locations[0].source.host_organization | https://openalex.org/I205783295 |
| locations[0].source.host_organization_name | Cornell University |
| locations[0].source.host_organization_lineage | https://openalex.org/I205783295 |
| locations[0].license | |
| locations[0].pdf_url | https://arxiv.org/pdf/2511.19690 |
| locations[0].version | submittedVersion |
| locations[0].raw_type | text |
| locations[0].license_id | |
| locations[0].is_accepted | False |
| locations[0].is_published | False |
| locations[0].raw_source_name | |
| locations[0].landing_page_url | http://arxiv.org/abs/2511.19690 |
| indexed_in | arxiv |
| authorships[0].author.id | |
| authorships[0].author.orcid | |
| authorships[0].author.display_name | Haas, Niklas |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Haas, Niklas |
| authorships[0].is_corresponding | True |
| authorships[1].author.id | https://openalex.org/A4290686353 |
| authorships[1].author.orcid | |
| authorships[1].author.display_name | Schmitt, Sören |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | Schmitt, Sören |
| authorships[1].is_corresponding | False |
| authorships[2].author.id | https://openalex.org/A4301477062 |
| authorships[2].author.orcid | |
| authorships[2].author.display_name | van Stee, Rob |
| authorships[2].author_position | last |
| authorships[2].raw_author_name | van Stee, Rob |
| authorships[2].is_corresponding | False |
| has_content.pdf | False |
| has_content.grobid_xml | False |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://arxiv.org/pdf/2511.19690 |
| open_access.oa_status | green |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-11-28T00:00:00 |
| display_name | The Buffer Minimization Problem for Scheduling Flow Jobs with Conflicts |
| has_fulltext | False |
| is_retracted | False |
| updated_date | 2025-11-28T02:12:24.556248 |
| primary_topic.id | https://openalex.org/T12288 |
| primary_topic.field.id | https://openalex.org/fields/17 |
| primary_topic.field.display_name | Computer Science |
| primary_topic.score | 0.5266996622085571 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/1705 |
| primary_topic.subfield.display_name | Computer Networks and Communications |
| primary_topic.display_name | Optimization and Search Problems |
| cited_by_count | 0 |
| locations_count | 1 |
| best_oa_location.id | pmh:oai:arXiv.org:2511.19690 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S4306400194 |
| best_oa_location.source.issn | |
| best_oa_location.source.type | repository |
| best_oa_location.source.is_oa | True |
| 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 | arXiv (Cornell University) |
| best_oa_location.source.host_organization | https://openalex.org/I205783295 |
| best_oa_location.source.host_organization_name | Cornell University |
| best_oa_location.source.host_organization_lineage | https://openalex.org/I205783295 |
| best_oa_location.license | |
| best_oa_location.pdf_url | https://arxiv.org/pdf/2511.19690 |
| 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 | http://arxiv.org/abs/2511.19690 |
| primary_location.id | pmh:oai:arXiv.org:2511.19690 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S4306400194 |
| primary_location.source.issn | |
| primary_location.source.type | repository |
| primary_location.source.is_oa | True |
| primary_location.source.issn_l | |
| primary_location.source.is_core | False |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | arXiv (Cornell University) |
| primary_location.source.host_organization | https://openalex.org/I205783295 |
| primary_location.source.host_organization_name | Cornell University |
| primary_location.source.host_organization_lineage | https://openalex.org/I205783295 |
| primary_location.license | |
| primary_location.pdf_url | https://arxiv.org/pdf/2511.19690 |
| primary_location.version | submittedVersion |
| primary_location.raw_type | text |
| primary_location.license_id | |
| primary_location.is_accepted | False |
| primary_location.is_published | False |
| primary_location.raw_source_name | |
| primary_location.landing_page_url | http://arxiv.org/abs/2511.19690 |
| publication_date | 2025-11-24 |
| publication_year | 2025 |
| referenced_works_count | 0 |
| abstract_inverted_index.a | 64, 86, 90, 192, 199 |
| abstract_inverted_index.An | 76 |
| abstract_inverted_index.In | 24 |
| abstract_inverted_index.We | 0, 139, 169 |
| abstract_inverted_index.an | 25, 40, 195 |
| abstract_inverted_index.as | 119 |
| abstract_inverted_index.at | 85, 122, 137 |
| abstract_inverted_index.by | 63 |
| abstract_inverted_index.in | 6, 18, 39 |
| abstract_inverted_index.is | 99 |
| abstract_inverted_index.of | 32, 54, 161, 191 |
| abstract_inverted_index.on | 30 |
| abstract_inverted_index.or | 135 |
| abstract_inverted_index.so | 88 |
| abstract_inverted_index.to | 69, 100, 198 |
| abstract_inverted_index.we | 183 |
| abstract_inverted_index.$n$ | 34 |
| abstract_inverted_index.(in | 12 |
| abstract_inverted_index.For | 179 |
| abstract_inverted_index.The | 97 |
| abstract_inverted_index.all | 107, 144 |
| abstract_inverted_index.and | 36, 46, 71, 157, 165, 194 |
| abstract_inverted_index.are | 37, 61, 83 |
| abstract_inverted_index.but | 50 |
| abstract_inverted_index.can | 44 |
| abstract_inverted_index.for | 143, 158, 175, 187 |
| abstract_inverted_index.gap | 186 |
| abstract_inverted_index.has | 153 |
| abstract_inverted_index.not | 136 |
| abstract_inverted_index.run | 45, 84 |
| abstract_inverted_index.the | 2, 14, 19, 33, 94, 102, 110, 113, 126, 150, 159, 180, 185, 188 |
| abstract_inverted_index.all. | 138 |
| abstract_inverted_index.also | 170 |
| abstract_inverted_index.been | 154 |
| abstract_inverted_index.edge | 197 |
| abstract_inverted_index.flow | 22, 127 |
| abstract_inverted_index.four | 147 |
| abstract_inverted_index.must | 79 |
| abstract_inverted_index.over | 133 |
| abstract_inverted_index.some | 31 |
| abstract_inverted_index.task | 58 |
| abstract_inverted_index.time | 124 |
| abstract_inverted_index.with | 9, 146 |
| abstract_inverted_index.edges | 72 |
| abstract_inverted_index.graph | 189 |
| abstract_inverted_index.input | 41 |
| abstract_inverted_index.model | 128 |
| abstract_inverted_index.pairs | 53 |
| abstract_inverted_index.path, | 151 |
| abstract_inverted_index.these | 48 |
| abstract_inverted_index.tight | 141, 173 |
| abstract_inverted_index.time; | 87 |
| abstract_inverted_index.valid | 91 |
| abstract_inverted_index.where | 66, 116 |
| abstract_inverted_index.which | 81, 152 |
| abstract_inverted_index.Unlike | 112 |
| abstract_inverted_index.across | 106 |
| abstract_inverted_index.almost | 172 |
| abstract_inverted_index.arrive | 29, 118, 131 |
| abstract_inverted_index.blocks | 121 |
| abstract_inverted_index.bounds | 142, 174 |
| abstract_inverted_index.buffer | 4, 15 |
| abstract_inverted_index.decide | 80 |
| abstract_inverted_index.during | 109 |
| abstract_inverted_index.fourth | 200 |
| abstract_inverted_index.graph, | 65 |
| abstract_inverted_index.graphs | 145, 164 |
| abstract_inverted_index.model, | 115, 182 |
| abstract_inverted_index.model. | 23 |
| abstract_inverted_index.narrow | 184 |
| abstract_inverted_index.online | 3, 26, 77 |
| abstract_inverted_index.pairs. | 75 |
| abstract_inverted_index.reduce | 47 |
| abstract_inverted_index.short, | 13 |
| abstract_inverted_index.solved | 155 |
| abstract_inverted_index.stored | 38 |
| abstract_inverted_index.(except | 149 |
| abstract_inverted_index.assumes | 129 |
| abstract_inverted_index.between | 52 |
| abstract_inverted_index.buffer. | 42 |
| abstract_inverted_index.general | 162 |
| abstract_inverted_index.graphs. | 168, 178 |
| abstract_inverted_index.maximal | 103 |
| abstract_inverted_index.points, | 125 |
| abstract_inverted_index.present | 140 |
| abstract_inverted_index.problem | 11 |
| abstract_inverted_index.provide | 89 |
| abstract_inverted_index.recover | 171 |
| abstract_inverted_index.systems | 8 |
| abstract_inverted_index.vertex. | 201 |
| abstract_inverted_index.complete | 163, 166, 176 |
| abstract_inverted_index.conflict | 95 |
| abstract_inverted_index.consider | 1 |
| abstract_inverted_index.discrete | 120 |
| abstract_inverted_index.families | 160 |
| abstract_inverted_index.fashion, | 27 |
| abstract_inverted_index.indicate | 73 |
| abstract_inverted_index.minimize | 101 |
| abstract_inverted_index.observed | 105 |
| abstract_inverted_index.original | 114, 181 |
| abstract_inverted_index.problem) | 17 |
| abstract_inverted_index.recently | 20 |
| abstract_inverted_index.restrict | 56 |
| abstract_inverted_index.schedule | 92 |
| abstract_inverted_index.specific | 123 |
| abstract_inverted_index.triangle | 193 |
| abstract_inverted_index.vertices | 67, 148 |
| abstract_inverted_index.workload | 104 |
| abstract_inverted_index.Conflicts | 60 |
| abstract_inverted_index.algorithm | 78 |
| abstract_inverted_index.bipartite | 167 |
| abstract_inverted_index.conflicts | 10, 51 |
| abstract_inverted_index.intervals | 134 |
| abstract_inverted_index.objective | 98 |
| abstract_inverted_index.schedule. | 111 |
| abstract_inverted_index.workloads | 28, 117, 130 |
| abstract_inverted_index.Processors | 43 |
| abstract_inverted_index.additional | 196 |
| abstract_inverted_index.consisting | 190 |
| abstract_inverted_index.correspond | 68 |
| abstract_inverted_index.execution. | 59 |
| abstract_inverted_index.introduced | 21 |
| abstract_inverted_index.processors | 35, 55, 70, 82, 108 |
| abstract_inverted_index.respecting | 93 |
| abstract_inverted_index.workloads, | 49 |
| abstract_inverted_index.$k$-partite | 177 |
| abstract_inverted_index.conflicting | 74 |
| abstract_inverted_index.previously) | 156 |
| abstract_inverted_index.represented | 62 |
| abstract_inverted_index.constraints. | 96 |
| abstract_inverted_index.continuously | 132 |
| abstract_inverted_index.minimization | 5, 16 |
| abstract_inverted_index.simultaneous | 57 |
| abstract_inverted_index.multiprocessor | 7 |
| cited_by_percentile_year | |
| countries_distinct_count | 0 |
| institutions_distinct_count | 3 |
| citation_normalized_percentile.value | 0.8383426 |
| citation_normalized_percentile.is_in_top_1_percent | False |
| citation_normalized_percentile.is_in_top_10_percent | True |