{"created":"2023-06-19T11:37:40.874638+00:00","id":5083,"links":{},"metadata":{"_buckets":{"deposit":"d18d666a-52fc-4d1b-93ca-bceb9c100bb6"},"_deposit":{"created_by":13,"id":"5083","owners":[13],"pid":{"revision_id":0,"type":"depid","value":"5083"},"status":"published"},"_oai":{"id":"oai:mie-u.repo.nii.ac.jp:00005083","sets":["366:367:368:394"]},"author_link":["10957","10958","10959"],"item_4_biblio_info_6":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2001-12-27","bibliographicIssueDateType":"Issued"},"bibliographicPageEnd":"68","bibliographicPageStart":"51","bibliographicVolumeNumber":"26","bibliographic_titles":[{"bibliographic_title":"Research reports of the Faculty of Engineering, Mie University"}]}]},"item_4_description_14":{"attribute_name":"フォーマット","attribute_value_mlt":[{"subitem_description":"application/pdf","subitem_description_type":"Other"}]},"item_4_description_4":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"This paper considers the scheduling problem of multi-processor systems under the condition that each processor is uniform and every instruction executes in one cycle. We propose two linear time scheduling algorithms which are respectively applicable to the two classes of dependence graphs, one of which consists of graphs with instructions of in-degree at most 2, and the other class of in-degree at most 3. We show that these algorithms produce optimal schedulings when these dependence graphs satisfy some more restricted conditions.","subitem_description_type":"Abstract"}]},"item_4_publisher_30":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"Faculty of Engineering, Mie University"}]},"item_4_source_id_7":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"0385-6208","subitem_source_identifier_type":"PISSN"}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA00816341","subitem_source_identifier_type":"NCID"}]},"item_4_text_18":{"attribute_name":"その他のタイトル","attribute_value_mlt":[{"subitem_text_language":"ja","subitem_text_value":"マルチプロセッサ向き目的コードスケジューリングについて"}]},"item_4_text_65":{"attribute_name":"資源タイプ（三重大）","attribute_value_mlt":[{"subitem_text_value":"Departmental Bulletin Paper / 紀要論文"}]},"item_4_version_type_15":{"attribute_name":"著者版フラグ","attribute_value_mlt":[{"subitem_version_resource":"http://purl.org/coar/version/c_970fb48d4fbd8a85","subitem_version_type":"VoR"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"MATSUBARA, Yoshikazu","creatorNameLang":"en"},{"creatorName":"松原, 義和","creatorNameLang":"ja"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"OYAMAGUCHI, Michio","creatorNameLang":"en"},{"creatorName":"大山口, 通夫","creatorNameLang":"ja"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"OHTA, Yoshikatsu","creatorNameLang":"en"},{"creatorName":"太田, 義勝","creatorNameLang":"ja"}],"nameIdentifiers":[{}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2017-02-18"}],"displaytype":"detail","filename":"AA008163410260007.PDF","filesize":[{"value":"1.2 MB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"AA008163410260007.PDF","url":"https://mie-u.repo.nii.ac.jp/record/5083/files/AA008163410260007.PDF"},"version_id":"e00bdcb3-e18d-49b1-8501-d787158bae14"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"Code Scheduling","subitem_subject_scheme":"Other"},{"subitem_subject":"Compiler Optimization","subitem_subject_scheme":"Other"},{"subitem_subject":"Multi-Processor","subitem_subject_scheme":"Other"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"departmental bulletin paper","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"Code Scheduling for Multi-Processor Systems","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Code Scheduling for Multi-Processor Systems","subitem_title_language":"en"}]},"item_type_id":"4","owner":"13","path":["394"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2007-07-02"},"publish_date":"2007-07-02","publish_status":"0","recid":"5083","relation_version_is_last":true,"title":["Code Scheduling for Multi-Processor Systems"],"weko_creator_id":"13","weko_shared_id":-1},"updated":"2023-10-05T07:37:51.370392+00:00"}