{"id":"https://openalex.org/W3084723961","doi":"https://doi.org/10.1109/hpcs48598.2019.9188196","title":"Fix Sort: A Good Strategy to Perform Segmented Sorting","display_name":"Fix Sort: A Good Strategy to Perform Segmented Sorting","publication_year":2019,"publication_date":"2019-07-01","ids":{"openalex":"https://openalex.org/W3084723961","doi":"https://doi.org/10.1109/hpcs48598.2019.9188196","mag":"3084723961"},"language":"en","primary_location":{"id":"doi:10.1109/hpcs48598.2019.9188196","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpcs48598.2019.9188196","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 International Conference on High Performance Computing & Simulation (HPCS)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5013269367","display_name":"Rafael F. Schmid","orcid":"https://orcid.org/0000-0002-6116-6317"},"institutions":[{"id":"https://openalex.org/I122558511","display_name":"Universidade Federal de Mato Grosso do Sul","ror":"https://ror.org/0366d2847","country_code":"BR","type":"education","lineage":["https://openalex.org/I122558511"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Rafael F. Schmid","raw_affiliation_strings":["Federal Institute of Mato Grosso do Sul Campo Grande, MS, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Federal Institute of Mato Grosso do Sul Campo Grande, MS, Brazil","institution_ids":["https://openalex.org/I122558511"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028026699","display_name":"Edson N. C\u00e1ceres","orcid":"https://orcid.org/0000-0001-6471-3462"},"institutions":[{"id":"https://openalex.org/I122558511","display_name":"Universidade Federal de Mato Grosso do Sul","ror":"https://ror.org/0366d2847","country_code":"BR","type":"education","lineage":["https://openalex.org/I122558511"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Edson N. Caceres","raw_affiliation_strings":["Federal Institute of Mato Grosso do Sul Campo Grande, MS, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Federal Institute of Mato Grosso do Sul Campo Grande, MS, Brazil","institution_ids":["https://openalex.org/I122558511"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I122558511"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.23810804,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"290","last_page":"297"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9962999820709229,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9868999719619751,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/sort","display_name":"sort","score":0.8471437096595764},{"id":"https://openalex.org/keywords/sorting-algorithm","display_name":"Sorting algorithm","score":0.830073893070221},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7584918737411499},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.7207379341125488},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5151252150535583},{"id":"https://openalex.org/keywords/merge-sort","display_name":"Merge sort","score":0.5056777000427246},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3976414203643799},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.08244216442108154}],"concepts":[{"id":"https://openalex.org/C88548561","wikidata":"https://www.wikidata.org/wiki/Q347599","display_name":"sort","level":2,"score":0.8471437096595764},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.830073893070221},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7584918737411499},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.7207379341125488},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5151252150535583},{"id":"https://openalex.org/C35555965","wikidata":"https://www.wikidata.org/wiki/Q189057","display_name":"Merge sort","level":4,"score":0.5056777000427246},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3976414203643799},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.08244216442108154}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/hpcs48598.2019.9188196","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpcs48598.2019.9188196","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 International Conference on High Performance Computing & Simulation (HPCS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1766577897","https://openalex.org/W2036073865","https://openalex.org/W2058692170","https://openalex.org/W2082695854","https://openalex.org/W2118558147","https://openalex.org/W2121387334","https://openalex.org/W2133732112","https://openalex.org/W2162707967","https://openalex.org/W2177607594","https://openalex.org/W2508119198","https://openalex.org/W2541617099","https://openalex.org/W2581221198","https://openalex.org/W2942827936","https://openalex.org/W3005521981","https://openalex.org/W6725221546"],"related_works":["https://openalex.org/W2085265870","https://openalex.org/W2362374543","https://openalex.org/W1480783219","https://openalex.org/W2295640672","https://openalex.org/W2175116031","https://openalex.org/W2348196682","https://openalex.org/W2977813765","https://openalex.org/W2118558147","https://openalex.org/W3038595913","https://openalex.org/W2267918355"],"abstract_inverted_index":{"In":[0,114],"order":[1],"to":[2,9,68,79,85,124,143],"solve":[3],"many":[4],"real":[5],"problems,":[6],"we":[7,117],"have":[8,31],"sort":[10,63,69,103,127,144,156],"array":[11,28,78],"segments":[12,70],"of":[13,34,71,154],"data.":[14],"This":[15,73],"sorting":[16,43,83],"task":[17],"is":[18],"called":[19,61],"segmented":[20,42,52,87],"sorting.":[21,53,88],"Problems":[22],"like":[23],"image":[24],"processing":[25],"and":[26,36,121,132],"suffix":[27],"construction":[29],"usually":[30],"huge":[32],"amount":[33],"data":[35],"their":[37],"solutions":[38],"make":[39],"use":[40],"the":[41,51,76,90,97,100,110,119,125,140,163],"procedure.":[44],"There":[45],"are":[46],"several":[47],"techniques":[48],"for":[49],"solving":[50],"A":[54],"previous":[55,98,141,164],"work":[56,116],"showed":[57,150],"that":[58,93,151],"a":[59,65],"strategy":[60,74,128,157],"fix":[62,102,126,155],"had":[64],"good":[66],"performance":[67],"arrays.":[72],"adjusts":[75],"input":[77],"allow":[80],"off-the-shelf":[81],"general":[82],"algorithms":[84,123],"execute":[86],"Besides":[89],"extensive":[91],"tests":[92],"were":[94],"done":[95],"in":[96,108],"work,":[99],"implemented":[101],"solution":[104],"did":[105],"not":[106],"explore":[107],"full":[109],"proposed":[111],"parallel":[112,122,131],"algorithm.":[113],"this":[115],"revisit":[118],"sequential":[120,133],"creating":[129],"new":[130],"implementations.":[134],"We":[135],"compared":[136],"our":[137,152],"results":[138,149],"with":[139],"methods":[142],"multiple":[145],"segments.":[146],"The":[147],"obtained":[148],"implementations":[153],"achieved":[158],"better":[159],"execution":[160],"times":[161],"than":[162],"ones.":[165]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}