WEKO3
アイテム
{"_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": ["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": [{"nameIdentifier": "10957", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "OYAMAGUCHI, Michio", "creatorNameLang": "en"}, {"creatorName": "大山口, 通夫", "creatorNameLang": "ja"}], "nameIdentifiers": [{"nameIdentifier": "10958", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "OHTA, Yoshikatsu", "creatorNameLang": "en"}, {"creatorName": "太田, 義勝", "creatorNameLang": "ja"}], "nameIdentifiers": [{"nameIdentifier": "10959", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "ファイル情報", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2017-02-18"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "AA008163410260007.PDF", "filesize": [{"value": "1.2 MB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_note", "mimetype": "application/pdf", "size": 1200000.0, "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"], "permalink_uri": "http://hdl.handle.net/10076/4098", "pubdate": {"attribute_name": "PubDate", "attribute_value": "2007-07-02"}, "publish_date": "2007-07-02", "publish_status": "0", "recid": "5083", "relation": {}, "relation_version_is_last": true, "title": ["Code Scheduling for Multi-Processor Systems"], "weko_shared_id": -1}
Code Scheduling for Multi-Processor Systems
http://hdl.handle.net/10076/4098
http://hdl.handle.net/10076/409871555c3d-938b-46ae-b934-4c317b16c425
名前 / ファイル | ライセンス | アクション |
---|---|---|
AA008163410260007.PDF (1.2 MB)
|
|
Item type | 紀要論文 / Departmental Bulletin Paper(1) | |||||
---|---|---|---|---|---|---|
公開日 | 2007-07-02 | |||||
タイトル | ||||||
言語 | en | |||||
タイトル | Code Scheduling for Multi-Processor Systems | |||||
言語 | ||||||
言語 | eng | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | Code Scheduling | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | Compiler Optimization | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | Multi-Processor | |||||
資源タイプ | ||||||
資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||
資源タイプ | departmental bulletin paper | |||||
著者 |
松原, 義和
× 松原, 義和× 大山口, 通夫× 太田, 義勝 |
|||||
抄録 | ||||||
内容記述タイプ | Abstract | |||||
内容記述 | 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. | |||||
書誌情報 |
Research reports of the Faculty of Engineering, Mie University 巻 26, p. 51-68, 発行日 2001-12-27 |
|||||
ISSN | ||||||
収録物識別子タイプ | PISSN | |||||
収録物識別子 | 0385-6208 | |||||
書誌レコードID | ||||||
収録物識別子タイプ | NCID | |||||
収録物識別子 | AA00816341 | |||||
フォーマット | ||||||
内容記述タイプ | Other | |||||
内容記述 | application/pdf | |||||
著者版フラグ | ||||||
出版タイプ | VoR | |||||
出版タイプResource | http://purl.org/coar/version/c_970fb48d4fbd8a85 | |||||
その他のタイトル | ||||||
ja | ||||||
マルチプロセッサ向き目的コードスケジューリングについて | ||||||
出版者 | ||||||
出版者 | Faculty of Engineering, Mie University | |||||
資源タイプ(三重大) | ||||||
Departmental Bulletin Paper / 紀要論文 |