{"id":"https://openalex.org/W4415275460","doi":"https://doi.org/10.48550/arxiv.2510.13279","title":"Partitioned Scheduling for DAG Tasks Considering Probabilistic Execution Time","display_name":"Partitioned Scheduling for DAG Tasks Considering Probabilistic Execution Time","publication_year":2025,"publication_date":"2025-10-15","ids":{"openalex":"https://openalex.org/W4415275460","doi":"https://doi.org/10.48550/arxiv.2510.13279"},"language":null,"primary_location":{"id":"pmh:oai:arXiv.org:2510.13279","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2510.13279","pdf_url":"https://arxiv.org/pdf/2510.13279","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2510.13279","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5119102185","display_name":"Fuma Omori","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Omori, Fuma","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089849223","display_name":"Atsushi Yano","orcid":"https://orcid.org/0000-0003-2420-3622"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yano, Atsushi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5022413623","display_name":"Takuya Azumi","orcid":"https://orcid.org/0000-0003-0767-4086"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Azumi, Takuya","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":true,"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/T10933","display_name":"Real-Time Systems Scheduling","score":0.958299994468689,"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/T10933","display_name":"Real-Time Systems Scheduling","score":0.958299994468689,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.8810999989509583},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6607000231742859},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.5759999752044678},{"id":"https://openalex.org/keywords/worst-case-execution-time","display_name":"Worst-case execution time","score":0.5558000206947327},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.47909998893737793},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.47540000081062317},{"id":"https://openalex.org/keywords/probabilistic-analysis-of-algorithms","display_name":"Probabilistic analysis of algorithms","score":0.4740000069141388},{"id":"https://openalex.org/keywords/execution-time","display_name":"Execution time","score":0.4424999952316284},{"id":"https://openalex.org/keywords/task-analysis","display_name":"Task analysis","score":0.43549999594688416}],"concepts":[{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.8810999989509583},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7943000197410583},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6607000231742859},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.5759999752044678},{"id":"https://openalex.org/C200130814","wikidata":"https://www.wikidata.org/wiki/Q362858","display_name":"Worst-case execution time","level":3,"score":0.5558000206947327},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.47909998893737793},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.47540000081062317},{"id":"https://openalex.org/C24404364","wikidata":"https://www.wikidata.org/wiki/Q7246846","display_name":"Probabilistic analysis of algorithms","level":3,"score":0.4740000069141388},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.4424999952316284},{"id":"https://openalex.org/C175154964","wikidata":"https://www.wikidata.org/wiki/Q380077","display_name":"Task analysis","level":3,"score":0.43549999594688416},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.3887999951839447},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3774999976158142},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.36469998955726624},{"id":"https://openalex.org/C2775907273","wikidata":"https://www.wikidata.org/wiki/Q7805281","display_name":"Time constraint","level":2,"score":0.35040000081062317},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.3346000015735626},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.3310000002384186},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.323199987411499},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32120001316070557},{"id":"https://openalex.org/C28472234","wikidata":"https://www.wikidata.org/wiki/Q213666","display_name":"Real-time operating system","level":2,"score":0.31220000982284546},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.31119999289512634},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.290800005197525},{"id":"https://openalex.org/C52063229","wikidata":"https://www.wikidata.org/wiki/Q7246845","display_name":"Probabilistic CTL","level":4,"score":0.28679999709129333},{"id":"https://openalex.org/C114289077","wikidata":"https://www.wikidata.org/wiki/Q3284399","display_name":"Statistical model","level":2,"score":0.2840999960899353},{"id":"https://openalex.org/C19012869","wikidata":"https://www.wikidata.org/wiki/Q578372","display_name":"Response time","level":2,"score":0.2824000120162964},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.28200000524520874},{"id":"https://openalex.org/C149441793","wikidata":"https://www.wikidata.org/wiki/Q200726","display_name":"Probability distribution","level":2,"score":0.2705000042915344},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2558000087738037}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2510.13279","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2510.13279","pdf_url":"https://arxiv.org/pdf/2510.13279","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2510.13279","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2510.13279","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"pmh:oai:arXiv.org:2510.13279","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2510.13279","pdf_url":"https://arxiv.org/pdf/2510.13279","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5580277002","display_name":null,"funder_award_id":"JPMJCR23M1","funder_id":"https://openalex.org/F4320338075","funder_display_name":"Core Research for Evolutional Science and Technology"}],"funders":[{"id":"https://openalex.org/F4320338075","display_name":"Core Research for Evolutional Science and Technology","ror":"https://ror.org/00097mb19"}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4415275460.pdf"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Autonomous":[0],"driving":[1],"systems,":[2],"critical":[3],"for":[4,48,56,66,77,124],"safety,":[5],"require":[6],"real-time":[7],"guarantees":[8,47,55,65,89],"and":[9,21],"can":[10],"be":[11],"modeled":[12],"as":[13,19],"DAGs.":[14,125],"Their":[15],"acceleration":[16],"features,":[17],"such":[18],"caches":[20],"pipelining,":[22],"often":[23],"result":[24],"in":[25],"execution":[26],"times":[27],"below":[28],"the":[29,61,92,105,137],"worst-case.":[30],"Thus,":[31],"a":[32,39,83,113],"probabilistic":[33,54,64,121],"approach":[34],"ensuring":[35],"constraint":[36],"satisfaction":[37],"within":[38],"probability":[40],"threshold":[41],"is":[42],"more":[43,73,109],"suitable":[44],"than":[45,75],"worst-case":[46],"these":[49],"systems.":[50],"This":[51,80],"paper":[52,81],"considers":[53],"DAG":[57,100],"tasks":[58],"by":[59],"utilizing":[60],"results":[62],"of":[63],"single":[67],"processors,":[68],"which":[69],"have":[70],"been":[71],"relatively":[72],"advanced":[74],"those":[76],"multi-core":[78],"processors.":[79],"proposes":[82],"task":[84,101,110,139],"set":[85],"partitioning":[86],"method":[87,107],"that":[88,104],"schedulability":[90,122],"under":[91],"partitioned":[93],"scheduling.":[94],"The":[95,126],"evaluation":[96,127],"on":[97],"randomly":[98],"generated":[99],"sets":[102,111],"demonstrates":[103],"proposed":[106],"schedules":[108,136],"with":[112],"smaller":[114],"mean":[115],"analysis":[116,123],"time":[117],"compared":[118],"to":[119],"existing":[120],"also":[128],"compares":[129],"four":[130],"bin-packing":[131],"heuristics,":[132],"revealing":[133],"Item-Centric":[134],"Worst-Fit-Decreasing":[135],"most":[138],"sets.":[140]},"counts_by_year":[],"updated_date":"2026-07-10T07:45:09.275182","created_date":"2025-10-17T00:00:00"}