{"id":"https://openalex.org/W7166729850","doi":"https://doi.org/10.48550/arxiv.2606.30460","title":"HSAP: A Hierarchical Sequence-aware Parallelism for Hybrid-Context Generative Models","display_name":"HSAP: A Hierarchical Sequence-aware Parallelism for Hybrid-Context Generative Models","publication_year":2026,"publication_date":"2026-06-29","ids":{"openalex":"https://openalex.org/W7166729850","doi":"https://doi.org/10.48550/arxiv.2606.30460"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.30460","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.30460","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2606.30460","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5139632707","display_name":"Songxin Zhang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhang, Songxin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5139652850","display_name":"Zejian Xie","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xie, Zejian","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5139693510","display_name":"Zhuoyang Song","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Song, Zhuoyang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038528790","display_name":"C Y Lin","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"lin, Cong","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015941605","display_name":"J Lu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lu, Junyu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5139672182","display_name":"Jiaxing Zhang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhang, Jiaxing","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5139688133","display_name":"Bingyi Jing","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jing, Bingyi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.2442999929189682,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.2442999929189682,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T12127","display_name":"Software System Performance and Reliability","score":0.07039999961853027,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10028","display_name":"Topic Modeling","score":0.03709999844431877,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/parallelism","display_name":"Parallelism (grammar)","score":0.7850000262260437},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.6288999915122986},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.5568000078201294},{"id":"https://openalex.org/keywords/instruction-level-parallelism","display_name":"Instruction-level parallelism","score":0.51419997215271},{"id":"https://openalex.org/keywords/task-parallelism","display_name":"Task parallelism","score":0.4975999891757965},{"id":"https://openalex.org/keywords/data-parallelism","display_name":"Data parallelism","score":0.48980000615119934},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.4268999993801117}],"concepts":[{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.7850000262260437},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7662000060081482},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.6288999915122986},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.5568000078201294},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5370000004768372},{"id":"https://openalex.org/C140763907","wikidata":"https://www.wikidata.org/wiki/Q2714055","display_name":"Instruction-level parallelism","level":3,"score":0.51419997215271},{"id":"https://openalex.org/C42992933","wikidata":"https://www.wikidata.org/wiki/Q691169","display_name":"Task parallelism","level":3,"score":0.4975999891757965},{"id":"https://openalex.org/C61483411","wikidata":"https://www.wikidata.org/wiki/Q3124522","display_name":"Data parallelism","level":3,"score":0.48980000615119934},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.4268999993801117},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4251999855041504},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38100001215934753},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.31360000371932983},{"id":"https://openalex.org/C3543717","wikidata":"https://www.wikidata.org/wiki/Q6007302","display_name":"Implicit parallelism","level":4,"score":0.2937999963760376},{"id":"https://openalex.org/C106515295","wikidata":"https://www.wikidata.org/wiki/Q26806595","display_name":"Parallel processing","level":2,"score":0.27090001106262207},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.26969999074935913},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.2669999897480011},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2662999927997589},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.2578999996185303}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.30460","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.30460","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2606.30460","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.30460","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0],"this":[1,102],"paper,":[2],"we":[3,104,147,186],"aim":[4],"to":[5,26,112,134,179],"combine":[6],"the":[7,18,24,32,71,85,99,114,136,169,176],"advantages":[8],"of":[9,21,45,87,116,139,175],"existing":[10,81,149],"sequence":[11,39,72,79,150,195],"parallelism":[12,40,69,95,151,196],"paradigms":[13,152],"and":[14,51,93,120,171],"overcomes":[15],"their":[16],"drawbacks,":[17],"most":[19],"serious":[20],"which":[22,62,159],"is":[23,75],"incapability":[25],"correctly":[27],"compute":[28],"causal":[29],"attention":[30,60,122],"on":[31,168],"hybrid-context":[33,88],"packed":[34],"sequences,":[35],"in":[36,59,70,78,143,198],"a":[37,154],"stronger":[38],"framework.":[41],"The":[42],"practical":[43],"technique":[44],"packing":[46],"sequences":[47,89],"for":[48,97],"efficiently":[49],"pretraining":[50],"fine-tuning":[52],"large":[53],"language":[54],"models":[55],"causes":[56],"cross-contamination":[57],"problem":[58],"computation,":[61],"can":[63],"be":[64],"effectively":[65],"solved":[66],"when":[67],"no":[68],"length":[73],"dimension":[74],"taken.":[76],"However,":[77],"parallelism,":[80],"approaches":[82],"either":[83],"ignore":[84],"scenario":[86],"or":[90],"conversely":[91],"sacrifice":[92],"limit":[94],"degree":[96],"supporting":[98],"scenario.":[100],"To":[101],"end,":[103],"innovatively":[105],"propose":[106],"an":[107],"efficient":[108],"Sequence-Aware":[109,156],"Parallelism":[110,157],"algorithm":[111,129],"conquer":[113],"obstacles":[115],"intensive":[117],"tensor":[118],"transmission":[119],"partial":[121],"computation":[123],"across":[124],"multiple":[125,184,199],"device":[126,141],"groups.":[127],"Our":[128],"utilizes":[130],"JIT":[131],"(Just-In-Time)":[132],"compilation":[133],"optimize":[135,180],"communication":[137,172],"strategy":[138],"all":[140],"groups":[142],"NCCL":[144],"level.":[145],"Further,":[146],"integrate":[148],"into":[153],"Hierarchical":[155],"framework":[158,178],"benefits":[160],"from":[161],"our":[162,189],"sequence-aware":[163],"algorithm.":[164],"We":[165],"additionally":[166],"elaborate":[167],"memory":[170],"overhead":[173],"management":[174],"hierarchical":[177],"its":[181],"performance.":[182],"Through":[183],"experiments,":[185],"demonstrate":[187],"that":[188],"proposed":[190],"approach":[191],"outperform":[192],"other":[193],"state-of-the-arts":[194],"approches":[197],"metrics.":[200]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-07-01T00:00:00"}