最大并行的事务排序问题

[1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing Pub Date : 1992-02-02 DOI:10.1109/RIDE.1992.227402

T. Kakeshita, Haiyan Xu

{"title":"最大并行的事务排序问题","authors":"T. Kakeshita, Haiyan Xu","doi":"10.1109/RIDE.1992.227402","DOIUrl":null,"url":null,"abstract":"The authors define the maximal parallelism scheduling problem and prove that it is NP hard. They examine a special case of the problem and find its nearly optimal solution in the succeeding section. The main techniques for finding an approximate solution are grouping of transactions and defining an order within each group. Moreover they define group of groups (higher level group) and improve approximation using it.<<ETX>>","PeriodicalId":138660,"journal":{"name":"[1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Transaction sequencing problems for maximal parallelism\",\"authors\":\"T. Kakeshita, Haiyan Xu\",\"doi\":\"10.1109/RIDE.1992.227402\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The authors define the maximal parallelism scheduling problem and prove that it is NP hard. They examine a special case of the problem and find its nearly optimal solution in the succeeding section. The main techniques for finding an approximate solution are grouping of transactions and defining an order within each group. Moreover they define group of groups (higher level group) and improve approximation using it.<<ETX>>\",\"PeriodicalId\":138660,\"journal\":{\"name\":\"[1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing\",\"volume\":\"37 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-02-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RIDE.1992.227402\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RIDE.1992.227402","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

定义了最大并行调度问题，并证明了它是NP困难的。他们研究了这个问题的一个特例，并在接下来的章节中找到了它的近似最优解。寻找近似解的主要技术是对事务进行分组，并在每组中定义顺序。此外，他们还定义了群的群(高级群)，并利用它来改进近似。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Transaction sequencing problems for maximal parallelism

The authors define the maximal parallelism scheduling problem and prove that it is NP hard. They examine a special case of the problem and find its nearly optimal solution in the succeeding section. The main techniques for finding an approximate solution are grouping of transactions and defining an order within each group. Moreover they define group of groups (higher level group) and improve approximation using it.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

[1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing

自引率

0.00%

发文量