WEKO3
アイテム
{"_buckets": {"deposit": "1946e3d0-cb9b-41ae-b9aa-87d440aab415"}, "_deposit": {"id": "19571", "owners": [], "pid": {"revision_id": 0, "type": "depid", "value": "19571"}, "status": "published"}, "_oai": {"id": "oai:soar-ir.repo.nii.ac.jp:00019571", "sets": ["1222"]}, "author_link": ["105081", "105082"], "item_1628147817048": {"attribute_name": "出版タイプ", "attribute_value_mlt": [{"subitem_version_resource": "http://purl.org/coar/version/c_ab4af688f83e57aa", "subitem_version_type": "AM"}]}, "item_6_biblio_info_6": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2012", "bibliographicIssueDateType": "Issued"}, "bibliographicIssueNumber": "23", "bibliographicPageEnd": "915", "bibliographicPageStart": "911", "bibliographicVolumeNumber": "112", "bibliographic_titles": [{"bibliographic_title": "INFORMATION PROCESSING LETTERS"}]}]}, "item_6_description_20": {"attribute_name": "抄録", "attribute_value_mlt": [{"subitem_description": "The competitive performance of the SRPT scheduling algorithm has been open for a long time except for being 2-competitive, where the objective is to minimize the total completion time. Chung et al. proved that the SRPT algorithm is 1.857-competitive. In this paper we improve their analysis and show a 1.792-competitiveness. We clearly mention that our result is not the best so far, since Sitters recently proved the algorithm is 1.250-competitive. Nevertheless, it is still well worth reporting our analytical method; our analysis is based on the modern functional optimization, which can scarcely be found in the literature on the analysis of algorithms. Our aim is to illustrate the potentiality of functional optimization with a concrete application. (C) 2012 Elsevier B.V. All rights reserved.", "subitem_description_type": "Abstract"}]}, "item_6_description_30": {"attribute_name": "資源タイプ(コンテンツの種類)", "attribute_value_mlt": [{"subitem_description": "Article", "subitem_description_type": "Other"}]}, "item_6_description_5": {"attribute_name": "引用", "attribute_value_mlt": [{"subitem_description": "INFORMATION PROCESSING LETTERS. 112(23): 911-915 (2012)", "subitem_description_type": "Other"}]}, "item_6_link_3": {"attribute_name": "信州大学研究者総覧へのリンク", "attribute_value_mlt": [{"subitem_link_text": "Fujiwara, Hiroshi", "subitem_link_url": "http://soar-rd.shinshu-u.ac.jp/profile/ja.OmSVOFnU.html"}]}, "item_6_link_67": {"attribute_name": "WoS", "attribute_value_mlt": [{"subitem_link_text": "Web of Science", "subitem_link_url": "http://gateway.isiknowledge.com/gateway/Gateway.cgi?\u0026GWVersion=2\u0026SrcAuth=ShinshuUniv\u0026SrcApp=ShinshuUniv\u0026DestLinkType=FullRecord\u0026DestApp=WOS\u0026KeyUT=000309849300005"}]}, "item_6_publisher_4": {"attribute_name": "出版者", "attribute_value_mlt": [{"subitem_publisher": "ELSEVIER SCIENCE BV"}]}, "item_6_relation_48": {"attribute_name": "DOI", "attribute_value_mlt": [{"subitem_relation_name": [{"subitem_relation_name_text": "10.1016/j.ipl.2012.08.009"}], "subitem_relation_type_id": {"subitem_relation_type_id_text": "https://doi.org/10.1016/j.ipl.2012.08.009", "subitem_relation_type_select": "DOI"}}]}, "item_6_rights_62": {"attribute_name": "権利", "attribute_value_mlt": [{"subitem_rights": "Copyright © 2012 Elsevier B.V. All rights reserved. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/ "}]}, "item_6_select_64": {"attribute_name": "著者版フラグ", "attribute_value_mlt": [{"subitem_select_item": "author"}]}, "item_6_source_id_35": {"attribute_name": "ISSN", "attribute_value_mlt": [{"subitem_source_identifier": "0020-0190", "subitem_source_identifier_type": "ISSN"}]}, "item_6_source_id_39": {"attribute_name": "NII ISSN", "attribute_value_mlt": [{"subitem_source_identifier": "0020-0190", "subitem_source_identifier_type": "ISSN"}]}, "item_6_text_69": {"attribute_name": "wosonly authkey", "attribute_value_mlt": [{"subitem_text_value": "Analysis of algorithms@@@On-line algorithms@@@Scheduling@@@Competitive analysis@@@Functional analysis"}]}, "item_6_text_70": {"attribute_name": "wosonly keywords", "attribute_value_mlt": [{"subitem_text_value": "AVERAGE COMPLETION-TIME"}]}, "item_creator": {"attribute_name": "著者", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "Fujiwara, Hiroshi"}], "nameIdentifiers": [{"nameIdentifier": "105081", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Sekiguchi, Yoshiyuki"}], "nameIdentifiers": [{"nameIdentifier": "105082", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "ファイル情報", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2018-03-09"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "An_Improved_Analysis_of_SRPT_Scheduling_Algorithm_on_the_Basis_of_Functional_Optimization.pdf", "filesize": [{"value": "85.8 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_note", "mimetype": "application/pdf", "size": 85800.0, "url": {"label": "An_Improved_Analysis_of_SRPT_Scheduling_Algorithm_on_the_Basis_of_Functional_Optimization.pdf", "url": "https://soar-ir.repo.nii.ac.jp/record/19571/files/An_Improved_Analysis_of_SRPT_Scheduling_Algorithm_on_the_Basis_of_Functional_Optimization.pdf"}, "version_id": "fe13e3d5-0400-49b1-bca0-3a626e0cca34"}]}, "item_keyword": {"attribute_name": "キーワード", "attribute_value_mlt": [{"subitem_subject": "Analysis of algorithms", "subitem_subject_scheme": "Other"}, {"subitem_subject": "On-line algorithms", "subitem_subject_scheme": "Other"}, {"subitem_subject": "Scheduling", "subitem_subject_scheme": "Other"}, {"subitem_subject": "Competitive analysis", "subitem_subject_scheme": "Other"}, {"subitem_subject": "Functional analysis", "subitem_subject_scheme": "Other"}]}, "item_language": {"attribute_name": "言語", "attribute_value_mlt": [{"subitem_language": "eng"}]}, "item_resource_type": {"attribute_name": "資源タイプ", "attribute_value_mlt": [{"resourcetype": "journal article", "resourceuri": "http://purl.org/coar/resource_type/c_6501"}]}, "item_title": "An improved analysis of SRPT scheduling algorithm on the basis of functional optimization", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "An improved analysis of SRPT scheduling algorithm on the basis of functional optimization", "subitem_title_language": "en"}]}, "item_type_id": "6", "owner": "1", "path": ["1222"], "permalink_uri": "http://hdl.handle.net/10091/00020332", "pubdate": {"attribute_name": "PubDate", "attribute_value": "2018-03-09"}, "publish_date": "2018-03-09", "publish_status": "0", "recid": "19571", "relation": {}, "relation_version_is_last": true, "title": ["An improved analysis of SRPT scheduling algorithm on the basis of functional optimization"], "weko_shared_id": -1}
An improved analysis of SRPT scheduling algorithm on the basis of functional optimization
http://hdl.handle.net/10091/00020332
http://hdl.handle.net/10091/0002033217b36414-4475-40bd-803d-1d2aaa3a167f
名前 / ファイル | ライセンス | アクション |
---|---|---|
![]() |
|
Item type | 学術雑誌論文 / Journal Article(1) | |||||
---|---|---|---|---|---|---|
公開日 | 2018-03-09 | |||||
タイトル | ||||||
言語 | en | |||||
タイトル | An improved analysis of SRPT scheduling algorithm on the basis of functional optimization | |||||
言語 | ||||||
言語 | eng | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | Analysis of algorithms | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | On-line algorithms | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | Scheduling | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | Competitive analysis | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | Functional analysis | |||||
資源タイプ | ||||||
資源 | http://purl.org/coar/resource_type/c_6501 | |||||
タイプ | journal article | |||||
著者 |
Fujiwara, Hiroshi
× Fujiwara, Hiroshi× Sekiguchi, Yoshiyuki |
|||||
信州大学研究者総覧へのリンク | ||||||
氏名 | Fujiwara, Hiroshi | |||||
URL | http://soar-rd.shinshu-u.ac.jp/profile/ja.OmSVOFnU.html | |||||
出版者 | ||||||
出版者 | ELSEVIER SCIENCE BV | |||||
引用 | ||||||
内容記述タイプ | Other | |||||
内容記述 | INFORMATION PROCESSING LETTERS. 112(23): 911-915 (2012) | |||||
書誌情報 |
INFORMATION PROCESSING LETTERS 巻 112, 号 23, p. 911-915, 発行日 2012 |
|||||
抄録 | ||||||
内容記述タイプ | Abstract | |||||
内容記述 | The competitive performance of the SRPT scheduling algorithm has been open for a long time except for being 2-competitive, where the objective is to minimize the total completion time. Chung et al. proved that the SRPT algorithm is 1.857-competitive. In this paper we improve their analysis and show a 1.792-competitiveness. We clearly mention that our result is not the best so far, since Sitters recently proved the algorithm is 1.250-competitive. Nevertheless, it is still well worth reporting our analytical method; our analysis is based on the modern functional optimization, which can scarcely be found in the literature on the analysis of algorithms. Our aim is to illustrate the potentiality of functional optimization with a concrete application. (C) 2012 Elsevier B.V. All rights reserved. | |||||
資源タイプ(コンテンツの種類) | ||||||
内容記述タイプ | Other | |||||
内容記述 | Article | |||||
ISSN | ||||||
収録物識別子タイプ | ISSN | |||||
収録物識別子 | 0020-0190 | |||||
DOI | ||||||
識別子タイプ | DOI | |||||
関連識別子 | https://doi.org/10.1016/j.ipl.2012.08.009 | |||||
関連名称 | 10.1016/j.ipl.2012.08.009 | |||||
権利 | ||||||
権利情報 | Copyright © 2012 Elsevier B.V. All rights reserved. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/ | |||||
出版タイプ | ||||||
出版タイプ | AM | |||||
出版タイプResource | http://purl.org/coar/version/c_ab4af688f83e57aa | |||||
WoS | ||||||
表示名 | Web of Science | |||||
URL | http://gateway.isiknowledge.com/gateway/Gateway.cgi?&GWVersion=2&SrcAuth=ShinshuUniv&SrcApp=ShinshuUniv&DestLinkType=FullRecord&DestApp=WOS&KeyUT=000309849300005 |