Using Computational Geometry to Improve Process Rescheduling on Round-Based Parallel Applications Article Swipe
Rodrigo da Rosa Righi
,
Vladimir Magalhaes Guerreiro
,
Gustavo Rostirolla
,
Vinicius Facco Rodrigues
,
Cristiano André da Costa
,
Leonardo Dagnino Chiwiacowsky
·
YOU?
·
· 2016
· Open Access
·
· DOI: https://doi.org/10.12694/scpe.v17i1.1147
YOU?
·
· 2016
· Open Access
·
· DOI: https://doi.org/10.12694/scpe.v17i1.1147
Process rescheduling is a known technique to face with system heterogeneity and dynamism, being especially pertinent on Bulk Synchronous Parallel (BSP) programs. These programs are organized in a set of round-based supersteps, in which the slowest process determines the moment of synchronization. This approach motivated us to develop a first model called MigBSP, which combines computation, communication and migration costs metrics for process rescheduling decisions. MigBSP originally employed an heuristic that could select either a single or a collection of process to migrate at each load balancing invocation. The first proposal is not reactive, so you should manually setup a percentage of processes to be migrated as input parameter for the load balancing model. In this work, two novel heuristics, named MigCube and MigHull, are proposed to choose the candidate processes for migration and their destination. Both heuristics consider the use of computational geometry for plotting computation, communication and migration costs metrics in a 3D graph, so both which and where load balancing questions can be answered without any user intervention. We believe that the contribution is not only in the MigBSP landscape, but also for the BSP community, who is trying to enhance performance in round-based applications in an effortless way. In addition to the description of MigCube and MigHull, this article also presents their evaluations with performance gains of up to 42% when enabling process migration over a subset of the Grid5000 infrastructure.
Related Topics
Concepts
Computer science
Heuristics
Load balancing (electrical power)
Computation
Distributed computing
Process (computing)
Process migration
Heuristic
Dynamism
Graph
Synchronization (alternating current)
Set (abstract data type)
Mathematical optimization
Theoretical computer science
Algorithm
Artificial intelligence
Grid
Mathematics
Programming language
Computer network
Quantum mechanics
Physics
Geometry
Channel (broadcasting)
Operating system
Metadata
- Type
- article
- Language
- en
- Landing Page
- https://doi.org/10.12694/scpe.v17i1.1147
- https://www.scpe.org/index.php/scpe/article/download/1147/465
- OA Status
- bronze
- References
- 35
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W2318629052
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W2318629052Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.12694/scpe.v17i1.1147Digital Object Identifier
- Title
-
Using Computational Geometry to Improve Process Rescheduling on Round-Based Parallel ApplicationsWork title
- Type
-
articleOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2016Year of publication
- Publication date
-
2016-03-25Full publication date if available
- Authors
-
Rodrigo da Rosa Righi, Vladimir Magalhaes Guerreiro, Gustavo Rostirolla, Vinicius Facco Rodrigues, Cristiano André da Costa, Leonardo Dagnino ChiwiacowskyList of authors in order
- Landing page
-
https://doi.org/10.12694/scpe.v17i1.1147Publisher landing page
- PDF URL
-
https://www.scpe.org/index.php/scpe/article/download/1147/465Direct link to full text PDF
- Open access
-
YesWhether a free full text is available
- OA status
-
bronzeOpen access status per OpenAlex
- OA URL
-
https://www.scpe.org/index.php/scpe/article/download/1147/465Direct OA link when available
- Concepts
-
Computer science, Heuristics, Load balancing (electrical power), Computation, Distributed computing, Process (computing), Process migration, Heuristic, Dynamism, Graph, Synchronization (alternating current), Set (abstract data type), Mathematical optimization, Theoretical computer science, Algorithm, Artificial intelligence, Grid, Mathematics, Programming language, Computer network, Quantum mechanics, Physics, Geometry, Channel (broadcasting), Operating systemTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
0Total citation count in OpenAlex
- References (count)
-
35Number of works referenced by this work
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W2318629052 |
|---|---|
| doi | https://doi.org/10.12694/scpe.v17i1.1147 |
| ids.doi | https://doi.org/10.12694/scpe.v17i1.1147 |
| ids.mag | 2318629052 |
| ids.openalex | https://openalex.org/W2318629052 |
| fwci | 0.0 |
| type | article |
| title | Using Computational Geometry to Improve Process Rescheduling on Round-Based Parallel Applications |
| biblio.issue | 1 |
| biblio.volume | 17 |
| biblio.last_page | |
| biblio.first_page | |
| topics[0].id | https://openalex.org/T10715 |
| topics[0].field.id | https://openalex.org/fields/17 |
| topics[0].field.display_name | Computer Science |
| topics[0].score | 1.0 |
| 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 | Distributed and Parallel Computing Systems |
| topics[1].id | https://openalex.org/T10054 |
| topics[1].field.id | https://openalex.org/fields/17 |
| topics[1].field.display_name | Computer Science |
| topics[1].score | 0.9993000030517578 |
| 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 | Parallel Computing and Optimization Techniques |
| topics[2].id | https://openalex.org/T10829 |
| topics[2].field.id | https://openalex.org/fields/17 |
| topics[2].field.display_name | Computer Science |
| topics[2].score | 0.9984999895095825 |
| 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 | Interconnection Networks and Systems |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C41008148 |
| concepts[0].level | 0 |
| concepts[0].score | 0.7948420643806458 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[0].display_name | Computer science |
| concepts[1].id | https://openalex.org/C127705205 |
| concepts[1].level | 2 |
| concepts[1].score | 0.7749425172805786 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q5748245 |
| concepts[1].display_name | Heuristics |
| concepts[2].id | https://openalex.org/C138959212 |
| concepts[2].level | 3 |
| concepts[2].score | 0.7720939517021179 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q1806783 |
| concepts[2].display_name | Load balancing (electrical power) |
| concepts[3].id | https://openalex.org/C45374587 |
| concepts[3].level | 2 |
| concepts[3].score | 0.6502877473831177 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q12525525 |
| concepts[3].display_name | Computation |
| concepts[4].id | https://openalex.org/C120314980 |
| concepts[4].level | 1 |
| concepts[4].score | 0.6267847418785095 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q180634 |
| concepts[4].display_name | Distributed computing |
| concepts[5].id | https://openalex.org/C98045186 |
| concepts[5].level | 2 |
| concepts[5].score | 0.6008376479148865 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q205663 |
| concepts[5].display_name | Process (computing) |
| concepts[6].id | https://openalex.org/C36351404 |
| concepts[6].level | 3 |
| concepts[6].score | 0.5579713582992554 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q7247295 |
| concepts[6].display_name | Process migration |
| concepts[7].id | https://openalex.org/C173801870 |
| concepts[7].level | 2 |
| concepts[7].score | 0.5100610852241516 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q201413 |
| concepts[7].display_name | Heuristic |
| concepts[8].id | https://openalex.org/C2775836275 |
| concepts[8].level | 2 |
| concepts[8].score | 0.47282564640045166 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q3502310 |
| concepts[8].display_name | Dynamism |
| concepts[9].id | https://openalex.org/C132525143 |
| concepts[9].level | 2 |
| concepts[9].score | 0.46373119950294495 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q141488 |
| concepts[9].display_name | Graph |
| concepts[10].id | https://openalex.org/C2778562939 |
| concepts[10].level | 3 |
| concepts[10].score | 0.4521978497505188 |
| concepts[10].wikidata | https://www.wikidata.org/wiki/Q1298791 |
| concepts[10].display_name | Synchronization (alternating current) |
| concepts[11].id | https://openalex.org/C177264268 |
| concepts[11].level | 2 |
| concepts[11].score | 0.45218178629875183 |
| concepts[11].wikidata | https://www.wikidata.org/wiki/Q1514741 |
| concepts[11].display_name | Set (abstract data type) |
| concepts[12].id | https://openalex.org/C126255220 |
| concepts[12].level | 1 |
| concepts[12].score | 0.3339928686618805 |
| concepts[12].wikidata | https://www.wikidata.org/wiki/Q141495 |
| concepts[12].display_name | Mathematical optimization |
| concepts[13].id | https://openalex.org/C80444323 |
| concepts[13].level | 1 |
| concepts[13].score | 0.29425299167633057 |
| concepts[13].wikidata | https://www.wikidata.org/wiki/Q2878974 |
| concepts[13].display_name | Theoretical computer science |
| concepts[14].id | https://openalex.org/C11413529 |
| concepts[14].level | 1 |
| concepts[14].score | 0.22361540794372559 |
| concepts[14].wikidata | https://www.wikidata.org/wiki/Q8366 |
| concepts[14].display_name | Algorithm |
| concepts[15].id | https://openalex.org/C154945302 |
| concepts[15].level | 1 |
| concepts[15].score | 0.12291726469993591 |
| concepts[15].wikidata | https://www.wikidata.org/wiki/Q11660 |
| concepts[15].display_name | Artificial intelligence |
| concepts[16].id | https://openalex.org/C187691185 |
| concepts[16].level | 2 |
| concepts[16].score | 0.09388062357902527 |
| concepts[16].wikidata | https://www.wikidata.org/wiki/Q2020720 |
| concepts[16].display_name | Grid |
| concepts[17].id | https://openalex.org/C33923547 |
| concepts[17].level | 0 |
| concepts[17].score | 0.09269127249717712 |
| concepts[17].wikidata | https://www.wikidata.org/wiki/Q395 |
| concepts[17].display_name | Mathematics |
| concepts[18].id | https://openalex.org/C199360897 |
| concepts[18].level | 1 |
| concepts[18].score | 0.08597525954246521 |
| concepts[18].wikidata | https://www.wikidata.org/wiki/Q9143 |
| concepts[18].display_name | Programming language |
| concepts[19].id | https://openalex.org/C31258907 |
| concepts[19].level | 1 |
| concepts[19].score | 0.08572754263877869 |
| concepts[19].wikidata | https://www.wikidata.org/wiki/Q1301371 |
| concepts[19].display_name | Computer network |
| concepts[20].id | https://openalex.org/C62520636 |
| concepts[20].level | 1 |
| concepts[20].score | 0.0 |
| concepts[20].wikidata | https://www.wikidata.org/wiki/Q944 |
| concepts[20].display_name | Quantum mechanics |
| concepts[21].id | https://openalex.org/C121332964 |
| concepts[21].level | 0 |
| concepts[21].score | 0.0 |
| concepts[21].wikidata | https://www.wikidata.org/wiki/Q413 |
| concepts[21].display_name | Physics |
| concepts[22].id | https://openalex.org/C2524010 |
| concepts[22].level | 1 |
| concepts[22].score | 0.0 |
| concepts[22].wikidata | https://www.wikidata.org/wiki/Q8087 |
| concepts[22].display_name | Geometry |
| concepts[23].id | https://openalex.org/C127162648 |
| concepts[23].level | 2 |
| concepts[23].score | 0.0 |
| concepts[23].wikidata | https://www.wikidata.org/wiki/Q16858953 |
| concepts[23].display_name | Channel (broadcasting) |
| concepts[24].id | https://openalex.org/C111919701 |
| concepts[24].level | 1 |
| concepts[24].score | 0.0 |
| concepts[24].wikidata | https://www.wikidata.org/wiki/Q9135 |
| concepts[24].display_name | Operating system |
| keywords[0].id | https://openalex.org/keywords/computer-science |
| keywords[0].score | 0.7948420643806458 |
| keywords[0].display_name | Computer science |
| keywords[1].id | https://openalex.org/keywords/heuristics |
| keywords[1].score | 0.7749425172805786 |
| keywords[1].display_name | Heuristics |
| keywords[2].id | https://openalex.org/keywords/load-balancing |
| keywords[2].score | 0.7720939517021179 |
| keywords[2].display_name | Load balancing (electrical power) |
| keywords[3].id | https://openalex.org/keywords/computation |
| keywords[3].score | 0.6502877473831177 |
| keywords[3].display_name | Computation |
| keywords[4].id | https://openalex.org/keywords/distributed-computing |
| keywords[4].score | 0.6267847418785095 |
| keywords[4].display_name | Distributed computing |
| keywords[5].id | https://openalex.org/keywords/process |
| keywords[5].score | 0.6008376479148865 |
| keywords[5].display_name | Process (computing) |
| keywords[6].id | https://openalex.org/keywords/process-migration |
| keywords[6].score | 0.5579713582992554 |
| keywords[6].display_name | Process migration |
| keywords[7].id | https://openalex.org/keywords/heuristic |
| keywords[7].score | 0.5100610852241516 |
| keywords[7].display_name | Heuristic |
| keywords[8].id | https://openalex.org/keywords/dynamism |
| keywords[8].score | 0.47282564640045166 |
| keywords[8].display_name | Dynamism |
| keywords[9].id | https://openalex.org/keywords/graph |
| keywords[9].score | 0.46373119950294495 |
| keywords[9].display_name | Graph |
| keywords[10].id | https://openalex.org/keywords/synchronization |
| keywords[10].score | 0.4521978497505188 |
| keywords[10].display_name | Synchronization (alternating current) |
| keywords[11].id | https://openalex.org/keywords/set |
| keywords[11].score | 0.45218178629875183 |
| keywords[11].display_name | Set (abstract data type) |
| keywords[12].id | https://openalex.org/keywords/mathematical-optimization |
| keywords[12].score | 0.3339928686618805 |
| keywords[12].display_name | Mathematical optimization |
| keywords[13].id | https://openalex.org/keywords/theoretical-computer-science |
| keywords[13].score | 0.29425299167633057 |
| keywords[13].display_name | Theoretical computer science |
| keywords[14].id | https://openalex.org/keywords/algorithm |
| keywords[14].score | 0.22361540794372559 |
| keywords[14].display_name | Algorithm |
| keywords[15].id | https://openalex.org/keywords/artificial-intelligence |
| keywords[15].score | 0.12291726469993591 |
| keywords[15].display_name | Artificial intelligence |
| keywords[16].id | https://openalex.org/keywords/grid |
| keywords[16].score | 0.09388062357902527 |
| keywords[16].display_name | Grid |
| keywords[17].id | https://openalex.org/keywords/mathematics |
| keywords[17].score | 0.09269127249717712 |
| keywords[17].display_name | Mathematics |
| keywords[18].id | https://openalex.org/keywords/programming-language |
| keywords[18].score | 0.08597525954246521 |
| keywords[18].display_name | Programming language |
| keywords[19].id | https://openalex.org/keywords/computer-network |
| keywords[19].score | 0.08572754263877869 |
| keywords[19].display_name | Computer network |
| language | en |
| locations[0].id | doi:10.12694/scpe.v17i1.1147 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S2764391171 |
| locations[0].source.issn | 1895-1767 |
| locations[0].source.type | journal |
| locations[0].source.is_oa | False |
| locations[0].source.issn_l | 1895-1767 |
| locations[0].source.is_core | True |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | Scalable Computing Practice and Experience |
| locations[0].source.host_organization | |
| locations[0].source.host_organization_name | |
| locations[0].license | |
| locations[0].pdf_url | https://www.scpe.org/index.php/scpe/article/download/1147/465 |
| locations[0].version | publishedVersion |
| locations[0].raw_type | journal-article |
| locations[0].license_id | |
| locations[0].is_accepted | True |
| locations[0].is_published | True |
| locations[0].raw_source_name | Scalable Computing: Practice and Experience |
| locations[0].landing_page_url | https://doi.org/10.12694/scpe.v17i1.1147 |
| indexed_in | crossref |
| authorships[0].author.id | https://openalex.org/A5008805433 |
| authorships[0].author.orcid | https://orcid.org/0000-0001-5080-7660 |
| authorships[0].author.display_name | Rodrigo da Rosa Righi |
| authorships[0].countries | BR |
| authorships[0].affiliations[0].institution_ids | https://openalex.org/I61722147 |
| authorships[0].affiliations[0].raw_affiliation_string | Applied Computing Graduate Program, Universidade do Vale do Rio dos Sinos, São Leopoldo -Rio Grande do Sul -Postal Code 93022-000 -Brazil |
| authorships[0].institutions[0].id | https://openalex.org/I61722147 |
| authorships[0].institutions[0].ror | https://ror.org/05ctmmy43 |
| authorships[0].institutions[0].type | education |
| authorships[0].institutions[0].lineage | https://openalex.org/I61722147 |
| authorships[0].institutions[0].country_code | BR |
| authorships[0].institutions[0].display_name | Universidade do Vale do Rio dos Sinos |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Rodrigo Da Rosa Righi |
| authorships[0].is_corresponding | False |
| authorships[0].raw_affiliation_strings | Applied Computing Graduate Program, Universidade do Vale do Rio dos Sinos, São Leopoldo -Rio Grande do Sul -Postal Code 93022-000 -Brazil |
| authorships[1].author.id | https://openalex.org/A5049193313 |
| authorships[1].author.orcid | |
| authorships[1].author.display_name | Vladimir Magalhaes Guerreiro |
| authorships[1].countries | BR |
| authorships[1].affiliations[0].institution_ids | https://openalex.org/I61722147 |
| authorships[1].affiliations[0].raw_affiliation_string | Applied Computing Graduate Program, Universidade do Vale do Rio dos Sinos, São Leopoldo -Rio Grande do Sul -Postal Code 93022-000 -Brazil |
| authorships[1].institutions[0].id | https://openalex.org/I61722147 |
| authorships[1].institutions[0].ror | https://ror.org/05ctmmy43 |
| authorships[1].institutions[0].type | education |
| authorships[1].institutions[0].lineage | https://openalex.org/I61722147 |
| authorships[1].institutions[0].country_code | BR |
| authorships[1].institutions[0].display_name | Universidade do Vale do Rio dos Sinos |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | Vladimir Magalhaes Guerreiro |
| authorships[1].is_corresponding | False |
| authorships[1].raw_affiliation_strings | Applied Computing Graduate Program, Universidade do Vale do Rio dos Sinos, São Leopoldo -Rio Grande do Sul -Postal Code 93022-000 -Brazil |
| authorships[2].author.id | https://openalex.org/A5088714528 |
| authorships[2].author.orcid | |
| authorships[2].author.display_name | Gustavo Rostirolla |
| authorships[2].countries | BR |
| authorships[2].affiliations[0].institution_ids | https://openalex.org/I61722147 |
| authorships[2].affiliations[0].raw_affiliation_string | Applied Computing Graduate Program, Universidade do Vale do Rio dos Sinos, São Leopoldo -Rio Grande do Sul -Postal Code 93022-000 -Brazil |
| authorships[2].institutions[0].id | https://openalex.org/I61722147 |
| authorships[2].institutions[0].ror | https://ror.org/05ctmmy43 |
| authorships[2].institutions[0].type | education |
| authorships[2].institutions[0].lineage | https://openalex.org/I61722147 |
| authorships[2].institutions[0].country_code | BR |
| authorships[2].institutions[0].display_name | Universidade do Vale do Rio dos Sinos |
| authorships[2].author_position | middle |
| authorships[2].raw_author_name | Gustavo Rostirolla |
| authorships[2].is_corresponding | False |
| authorships[2].raw_affiliation_strings | Applied Computing Graduate Program, Universidade do Vale do Rio dos Sinos, São Leopoldo -Rio Grande do Sul -Postal Code 93022-000 -Brazil |
| authorships[3].author.id | https://openalex.org/A5046845423 |
| authorships[3].author.orcid | https://orcid.org/0000-0001-6129-0548 |
| authorships[3].author.display_name | Vinicius Facco Rodrigues |
| authorships[3].countries | BR |
| authorships[3].affiliations[0].institution_ids | https://openalex.org/I61722147 |
| authorships[3].affiliations[0].raw_affiliation_string | Applied Computing Graduate Program, Universidade do Vale do Rio dos Sinos, São Leopoldo -Rio Grande do Sul -Postal Code 93022-000 -Brazil |
| authorships[3].institutions[0].id | https://openalex.org/I61722147 |
| authorships[3].institutions[0].ror | https://ror.org/05ctmmy43 |
| authorships[3].institutions[0].type | education |
| authorships[3].institutions[0].lineage | https://openalex.org/I61722147 |
| authorships[3].institutions[0].country_code | BR |
| authorships[3].institutions[0].display_name | Universidade do Vale do Rio dos Sinos |
| authorships[3].author_position | middle |
| authorships[3].raw_author_name | Vinicius Facco Rodrigues |
| authorships[3].is_corresponding | False |
| authorships[3].raw_affiliation_strings | Applied Computing Graduate Program, Universidade do Vale do Rio dos Sinos, São Leopoldo -Rio Grande do Sul -Postal Code 93022-000 -Brazil |
| authorships[4].author.id | https://openalex.org/A5024617531 |
| authorships[4].author.orcid | https://orcid.org/0000-0003-3859-6199 |
| authorships[4].author.display_name | Cristiano André da Costa |
| authorships[4].countries | BR |
| authorships[4].affiliations[0].institution_ids | https://openalex.org/I61722147 |
| authorships[4].affiliations[0].raw_affiliation_string | Applied Computing Graduate Program, Universidade do Vale do Rio dos Sinos, São Leopoldo -Rio Grande do Sul -Postal Code 93022-000 -Brazil |
| authorships[4].institutions[0].id | https://openalex.org/I61722147 |
| authorships[4].institutions[0].ror | https://ror.org/05ctmmy43 |
| authorships[4].institutions[0].type | education |
| authorships[4].institutions[0].lineage | https://openalex.org/I61722147 |
| authorships[4].institutions[0].country_code | BR |
| authorships[4].institutions[0].display_name | Universidade do Vale do Rio dos Sinos |
| authorships[4].author_position | middle |
| authorships[4].raw_author_name | Cristiano Andre Da Costa |
| authorships[4].is_corresponding | False |
| authorships[4].raw_affiliation_strings | Applied Computing Graduate Program, Universidade do Vale do Rio dos Sinos, São Leopoldo -Rio Grande do Sul -Postal Code 93022-000 -Brazil |
| authorships[5].author.id | https://openalex.org/A5073818844 |
| authorships[5].author.orcid | https://orcid.org/0000-0003-4016-0984 |
| authorships[5].author.display_name | Leonardo Dagnino Chiwiacowsky |
| authorships[5].countries | BR |
| authorships[5].affiliations[0].institution_ids | https://openalex.org/I61722147 |
| authorships[5].affiliations[0].raw_affiliation_string | Applied Computing Graduate Program, Universidade do Vale do Rio dos Sinos, São Leopoldo -Rio Grande do Sul -Postal Code 93022-000 -Brazil |
| authorships[5].institutions[0].id | https://openalex.org/I61722147 |
| authorships[5].institutions[0].ror | https://ror.org/05ctmmy43 |
| authorships[5].institutions[0].type | education |
| authorships[5].institutions[0].lineage | https://openalex.org/I61722147 |
| authorships[5].institutions[0].country_code | BR |
| authorships[5].institutions[0].display_name | Universidade do Vale do Rio dos Sinos |
| authorships[5].author_position | last |
| authorships[5].raw_author_name | Leonardo Dagnino Chiwiacowsky |
| authorships[5].is_corresponding | False |
| authorships[5].raw_affiliation_strings | Applied Computing Graduate Program, Universidade do Vale do Rio dos Sinos, São Leopoldo -Rio Grande do Sul -Postal Code 93022-000 -Brazil |
| has_content.pdf | True |
| has_content.grobid_xml | True |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://www.scpe.org/index.php/scpe/article/download/1147/465 |
| open_access.oa_status | bronze |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | Using Computational Geometry to Improve Process Rescheduling on Round-Based Parallel Applications |
| has_fulltext | False |
| is_retracted | False |
| updated_date | 2025-11-06T03:46:38.306776 |
| primary_topic.id | https://openalex.org/T10715 |
| primary_topic.field.id | https://openalex.org/fields/17 |
| primary_topic.field.display_name | Computer Science |
| primary_topic.score | 1.0 |
| 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 | Distributed and Parallel Computing Systems |
| related_works | https://openalex.org/W2000438032, https://openalex.org/W2775384662, https://openalex.org/W2385556862, https://openalex.org/W4297288183, https://openalex.org/W4297802007, https://openalex.org/W2551475964, https://openalex.org/W3115406561, https://openalex.org/W2503402958, https://openalex.org/W2043284556, https://openalex.org/W4384567729 |
| cited_by_count | 0 |
| locations_count | 1 |
| best_oa_location.id | doi:10.12694/scpe.v17i1.1147 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S2764391171 |
| best_oa_location.source.issn | 1895-1767 |
| best_oa_location.source.type | journal |
| best_oa_location.source.is_oa | False |
| best_oa_location.source.issn_l | 1895-1767 |
| best_oa_location.source.is_core | True |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | Scalable Computing Practice and Experience |
| best_oa_location.source.host_organization | |
| best_oa_location.source.host_organization_name | |
| best_oa_location.license | |
| best_oa_location.pdf_url | https://www.scpe.org/index.php/scpe/article/download/1147/465 |
| best_oa_location.version | publishedVersion |
| best_oa_location.raw_type | journal-article |
| best_oa_location.license_id | |
| best_oa_location.is_accepted | True |
| best_oa_location.is_published | True |
| best_oa_location.raw_source_name | Scalable Computing: Practice and Experience |
| best_oa_location.landing_page_url | https://doi.org/10.12694/scpe.v17i1.1147 |
| primary_location.id | doi:10.12694/scpe.v17i1.1147 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S2764391171 |
| primary_location.source.issn | 1895-1767 |
| primary_location.source.type | journal |
| primary_location.source.is_oa | False |
| primary_location.source.issn_l | 1895-1767 |
| primary_location.source.is_core | True |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | Scalable Computing Practice and Experience |
| primary_location.source.host_organization | |
| primary_location.source.host_organization_name | |
| primary_location.license | |
| primary_location.pdf_url | https://www.scpe.org/index.php/scpe/article/download/1147/465 |
| primary_location.version | publishedVersion |
| primary_location.raw_type | journal-article |
| primary_location.license_id | |
| primary_location.is_accepted | True |
| primary_location.is_published | True |
| primary_location.raw_source_name | Scalable Computing: Practice and Experience |
| primary_location.landing_page_url | https://doi.org/10.12694/scpe.v17i1.1147 |
| publication_date | 2016-03-25 |
| publication_year | 2016 |
| referenced_works | https://openalex.org/W2105047810, https://openalex.org/W2064635301, https://openalex.org/W2170616854, https://openalex.org/W2048206646, https://openalex.org/W2145963487, https://openalex.org/W2153129688, https://openalex.org/W2102745833, https://openalex.org/W2340622231, https://openalex.org/W2102083085, https://openalex.org/W2097671757, https://openalex.org/W2153504150, https://openalex.org/W1539393101, https://openalex.org/W1603950378, https://openalex.org/W1670604891, https://openalex.org/W2949853069, https://openalex.org/W2013136000, https://openalex.org/W2165432926, https://openalex.org/W2025397485, https://openalex.org/W2154525962, https://openalex.org/W2093615533, https://openalex.org/W2028420690, https://openalex.org/W4210521336, https://openalex.org/W2093615050, https://openalex.org/W1956058434, https://openalex.org/W2045271686, https://openalex.org/W2011039300, https://openalex.org/W2115377667, https://openalex.org/W1981707544, https://openalex.org/W2170721079, https://openalex.org/W2007321841, https://openalex.org/W1499242862, https://openalex.org/W1613273921, https://openalex.org/W2024915064, https://openalex.org/W2058254833, https://openalex.org/W2007401773 |
| referenced_works_count | 35 |
| abstract_inverted_index.a | 3, 27, 48, 74, 77, 99, 153, 229 |
| abstract_inverted_index.3D | 154 |
| abstract_inverted_index.In | 114, 202 |
| abstract_inverted_index.We | 171 |
| abstract_inverted_index.an | 68, 199 |
| abstract_inverted_index.as | 106 |
| abstract_inverted_index.at | 83 |
| abstract_inverted_index.be | 104, 165 |
| abstract_inverted_index.in | 26, 32, 152, 179, 195, 198 |
| abstract_inverted_index.is | 2, 91, 176, 190 |
| abstract_inverted_index.of | 29, 40, 79, 101, 141, 207, 220, 231 |
| abstract_inverted_index.on | 16 |
| abstract_inverted_index.or | 76 |
| abstract_inverted_index.so | 94, 156 |
| abstract_inverted_index.to | 6, 46, 81, 103, 126, 192, 204, 222 |
| abstract_inverted_index.up | 221 |
| abstract_inverted_index.us | 45 |
| abstract_inverted_index.42% | 223 |
| abstract_inverted_index.BSP | 187 |
| abstract_inverted_index.The | 88 |
| abstract_inverted_index.and | 11, 57, 122, 133, 148, 159, 209 |
| abstract_inverted_index.any | 168 |
| abstract_inverted_index.are | 24, 124 |
| abstract_inverted_index.but | 183 |
| abstract_inverted_index.can | 164 |
| abstract_inverted_index.for | 61, 109, 131, 144, 185 |
| abstract_inverted_index.not | 92, 177 |
| abstract_inverted_index.set | 28 |
| abstract_inverted_index.the | 34, 38, 110, 128, 139, 174, 180, 186, 205, 232 |
| abstract_inverted_index.two | 117 |
| abstract_inverted_index.use | 140 |
| abstract_inverted_index.who | 189 |
| abstract_inverted_index.you | 95 |
| abstract_inverted_index.Both | 136 |
| abstract_inverted_index.Bulk | 17 |
| abstract_inverted_index.This | 42 |
| abstract_inverted_index.also | 184, 213 |
| abstract_inverted_index.both | 157 |
| abstract_inverted_index.each | 84 |
| abstract_inverted_index.face | 7 |
| abstract_inverted_index.load | 85, 111, 161 |
| abstract_inverted_index.only | 178 |
| abstract_inverted_index.over | 228 |
| abstract_inverted_index.that | 70, 173 |
| abstract_inverted_index.this | 115, 211 |
| abstract_inverted_index.user | 169 |
| abstract_inverted_index.way. | 201 |
| abstract_inverted_index.when | 224 |
| abstract_inverted_index.with | 8, 217 |
| abstract_inverted_index.(BSP) | 20 |
| abstract_inverted_index.These | 22 |
| abstract_inverted_index.being | 13 |
| abstract_inverted_index.costs | 59, 150 |
| abstract_inverted_index.could | 71 |
| abstract_inverted_index.first | 49, 89 |
| abstract_inverted_index.gains | 219 |
| abstract_inverted_index.input | 107 |
| abstract_inverted_index.known | 4 |
| abstract_inverted_index.model | 50 |
| abstract_inverted_index.named | 120 |
| abstract_inverted_index.novel | 118 |
| abstract_inverted_index.setup | 98 |
| abstract_inverted_index.their | 134, 215 |
| abstract_inverted_index.where | 160 |
| abstract_inverted_index.which | 33, 53, 158 |
| abstract_inverted_index.work, | 116 |
| abstract_inverted_index.MigBSP | 65, 181 |
| abstract_inverted_index.called | 51 |
| abstract_inverted_index.choose | 127 |
| abstract_inverted_index.either | 73 |
| abstract_inverted_index.graph, | 155 |
| abstract_inverted_index.model. | 113 |
| abstract_inverted_index.moment | 39 |
| abstract_inverted_index.select | 72 |
| abstract_inverted_index.should | 96 |
| abstract_inverted_index.single | 75 |
| abstract_inverted_index.subset | 230 |
| abstract_inverted_index.system | 9 |
| abstract_inverted_index.trying | 191 |
| abstract_inverted_index.MigBSP, | 52 |
| abstract_inverted_index.MigCube | 121, 208 |
| abstract_inverted_index.Process | 0 |
| abstract_inverted_index.article | 212 |
| abstract_inverted_index.believe | 172 |
| abstract_inverted_index.develop | 47 |
| abstract_inverted_index.enhance | 193 |
| abstract_inverted_index.metrics | 60, 151 |
| abstract_inverted_index.migrate | 82 |
| abstract_inverted_index.process | 36, 62, 80, 226 |
| abstract_inverted_index.slowest | 35 |
| abstract_inverted_index.without | 167 |
| abstract_inverted_index.Grid5000 | 233 |
| abstract_inverted_index.MigHull, | 123, 210 |
| abstract_inverted_index.Parallel | 19 |
| abstract_inverted_index.addition | 203 |
| abstract_inverted_index.answered | 166 |
| abstract_inverted_index.approach | 43 |
| abstract_inverted_index.combines | 54 |
| abstract_inverted_index.consider | 138 |
| abstract_inverted_index.employed | 67 |
| abstract_inverted_index.enabling | 225 |
| abstract_inverted_index.geometry | 143 |
| abstract_inverted_index.manually | 97 |
| abstract_inverted_index.migrated | 105 |
| abstract_inverted_index.plotting | 145 |
| abstract_inverted_index.presents | 214 |
| abstract_inverted_index.programs | 23 |
| abstract_inverted_index.proposal | 90 |
| abstract_inverted_index.proposed | 125 |
| abstract_inverted_index.balancing | 86, 112, 162 |
| abstract_inverted_index.candidate | 129 |
| abstract_inverted_index.dynamism, | 12 |
| abstract_inverted_index.heuristic | 69 |
| abstract_inverted_index.migration | 58, 132, 149, 227 |
| abstract_inverted_index.motivated | 44 |
| abstract_inverted_index.organized | 25 |
| abstract_inverted_index.parameter | 108 |
| abstract_inverted_index.pertinent | 15 |
| abstract_inverted_index.processes | 102, 130 |
| abstract_inverted_index.programs. | 21 |
| abstract_inverted_index.questions | 163 |
| abstract_inverted_index.reactive, | 93 |
| abstract_inverted_index.technique | 5 |
| abstract_inverted_index.collection | 78 |
| abstract_inverted_index.community, | 188 |
| abstract_inverted_index.decisions. | 64 |
| abstract_inverted_index.determines | 37 |
| abstract_inverted_index.effortless | 200 |
| abstract_inverted_index.especially | 14 |
| abstract_inverted_index.heuristics | 137 |
| abstract_inverted_index.landscape, | 182 |
| abstract_inverted_index.originally | 66 |
| abstract_inverted_index.percentage | 100 |
| abstract_inverted_index.Synchronous | 18 |
| abstract_inverted_index.description | 206 |
| abstract_inverted_index.evaluations | 216 |
| abstract_inverted_index.heuristics, | 119 |
| abstract_inverted_index.invocation. | 87 |
| abstract_inverted_index.performance | 194, 218 |
| abstract_inverted_index.round-based | 30, 196 |
| abstract_inverted_index.supersteps, | 31 |
| abstract_inverted_index.applications | 197 |
| abstract_inverted_index.computation, | 55, 146 |
| abstract_inverted_index.contribution | 175 |
| abstract_inverted_index.destination. | 135 |
| abstract_inverted_index.rescheduling | 1, 63 |
| abstract_inverted_index.communication | 56, 147 |
| abstract_inverted_index.computational | 142 |
| abstract_inverted_index.heterogeneity | 10 |
| abstract_inverted_index.intervention. | 170 |
| abstract_inverted_index.infrastructure. | 234 |
| abstract_inverted_index.synchronization. | 41 |
| cited_by_percentile_year | |
| countries_distinct_count | 1 |
| institutions_distinct_count | 6 |
| citation_normalized_percentile.value | 0.01846748 |
| citation_normalized_percentile.is_in_top_1_percent | False |
| citation_normalized_percentile.is_in_top_10_percent | False |