{"id":220199,"updated":"2025-01-19T13:55:39.785152+00:00","links":{},"created":"2025-01-19T01:20:14.717217+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00220199","sets":["581:10784:10794"]},"path":["10794"],"owner":"44499","recid":"220199","title":["LET Paradigm Scheduling Algorithm Considering Parallel Processing on Clustered Many-core Processor "],"pubdate":{"attribute_name":"公開日","attribute_value":"2022-09-15"},"_buckets":{"deposit":"c5af428f-cab0-4ed9-b65c-7478991de24d"},"_deposit":{"id":"220199","pid":{"type":"depid","value":"220199","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"LET Paradigm Scheduling Algorithm Considering Parallel Processing on Clustered Many-core Processor ","author_link":["581566","581565","581563","581567","581568","581564"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"LET Paradigm Scheduling Algorithm Considering Parallel Processing on Clustered Many-core Processor "},{"subitem_title":"LET Paradigm Scheduling Algorithm Considering Parallel Processing on Clustered Many-core Processor ","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"[特集:組込みシステム工学] multi-period DAG, multi/many-core, contention-free, parallel processing, logical execution time","subitem_subject_scheme":"Other"}]},"item_type_id":"2","publish_date":"2022-09-15","item_2_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Science and Engineering, Saitama University"},{"subitem_text_value":"Graduate School of Science and Engineering, Saitama University"},{"subitem_text_value":"Graduate School of Science and Engineering, Saitama University"}]},"item_2_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Science and Engineering, Saitama University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Science and Engineering, Saitama University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Science and Engineering, Saitama University","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/220199/files/IPSJ-JNL6309015.pdf","label":"IPSJ-JNL6309015.pdf"},"date":[{"dateType":"Available","dateValue":"2024-09-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-JNL6309015.pdf","filesize":[{"value":"901.3 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"0","billingrole":"5"},{"tax":["include_tax"],"price":"0","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"8"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"7e09e459-207d-4c0b-9802-d3f5cd7a4f71","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2022 by the Information Processing Society of Japan"}]},"item_2_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Atsushi, Yano"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Shingo, Igarashi"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Takuya, Azumi"}],"nameIdentifiers":[{}]}]},"item_2_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Atsushi, Yano","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Shingo, Igarashi","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Takuya, Azumi","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_2_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00116647","subitem_source_identifier_type":"NCID"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_6501","resourcetype":"journal article"}]},"item_2_publisher_15":{"attribute_name":"公開者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"item_2_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7764","subitem_source_identifier_type":"ISSN"}]},"item_2_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"Embedded systems such as self-driving systems require computing platforms with high computing power and low power consumption. Multi/many-core platforms meet these requirements effectively. However, for hard real-time applications, multiple demands on shared resources can impede real-time performance, and in particular, memory is a resource that can restrict the desired performance significantly. Therefore, the logical execution time (LET) paradigm has gained attention to make the timing of memory access deterministic. This paper proposes a theoretical scheduling method for a model applying the LET paradigm to the directed acyclic graph (DAG) nodes for a multi/many-core platform. However, the LET paradigm lacks scalability owing to the overhead caused because the LET paradigm is set longer than the actual execution time of the task. The proposed method performs a parallel calculation of tasks utilizing many cores to deal with the overhead caused by adopting the LET paradigm. The evaluation shows that the proposed method benefits from the adoption of the LET paradigm and that the end-to-end latency variation is smaller than in the existing scheduling methods. Furthermore, the evaluation shows that the proposed method can maintain the task deadline miss low, despite the overhead of the LET paradigm.\n------------------------------\nThis is a preprint of an article intended for publication Journal of\nInformation Processing(JIP). This preprint should not be cited. This\narticle should be cited as: Journal of Information Processing Vol.30(2022) (online)\nDOI　http://dx.doi.org/10.2197/ipsjjip.30.646\n------------------------------","subitem_description_type":"Other"}]},"item_2_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Embedded systems such as self-driving systems require computing platforms with high computing power and low power consumption. Multi/many-core platforms meet these requirements effectively. However, for hard real-time applications, multiple demands on shared resources can impede real-time performance, and in particular, memory is a resource that can restrict the desired performance significantly. Therefore, the logical execution time (LET) paradigm has gained attention to make the timing of memory access deterministic. This paper proposes a theoretical scheduling method for a model applying the LET paradigm to the directed acyclic graph (DAG) nodes for a multi/many-core platform. However, the LET paradigm lacks scalability owing to the overhead caused because the LET paradigm is set longer than the actual execution time of the task. The proposed method performs a parallel calculation of tasks utilizing many cores to deal with the overhead caused by adopting the LET paradigm. The evaluation shows that the proposed method benefits from the adoption of the LET paradigm and that the end-to-end latency variation is smaller than in the existing scheduling methods. Furthermore, the evaluation shows that the proposed method can maintain the task deadline miss low, despite the overhead of the LET paradigm.\n------------------------------\nThis is a preprint of an article intended for publication Journal of\nInformation Processing(JIP). This preprint should not be cited. This\narticle should be cited as: Journal of Information Processing Vol.30(2022) (online)\nDOI　http://dx.doi.org/10.2197/ipsjjip.30.646\n------------------------------","subitem_description_type":"Other"}]},"item_2_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌"}],"bibliographicIssueDates":{"bibliographicIssueDate":"2022-09-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"9","bibliographicVolumeNumber":"63"}]},"relation_version_is_last":true,"weko_creator_id":"44499"}}