发布求助
文献互助 智能选刊 最新文献

Parallel Processing of Discrete Optimization Problems最新文献

筛选
英文 中文
Parallel Algorithms for the Assignment Problem - An Experimental Evaluation of Three Distributed Algorithms 分配问题的并行算法——三种分布式算法的实验评价
Parallel Processing of Discrete Optimization Problems Pub Date : 1900-01-01 DOI: 10.1090/dimacs/022/15
Christian Schutt, J. Clausen
{"title":"Parallel Algorithms for the Assignment Problem - An Experimental Evaluation of Three Distributed Algorithms","authors":"Christian Schutt, J. Clausen","doi":"10.1090/dimacs/022/15","DOIUrl":"https://doi.org/10.1090/dimacs/022/15","url":null,"abstract":"","PeriodicalId":336054,"journal":{"name":"Parallel Processing of Discrete Optimization Problems","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122961151","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
A Note on Parallel Randomized Algorithms for Searching Problems 搜索问题的并行随机算法注释
Parallel Processing of Discrete Optimization Problems Pub Date : 1900-01-01 DOI: 10.1090/dimacs/022/02
Andrea Clemnti, J. Rolim, L. Kucera
{"title":"A Note on Parallel Randomized Algorithms for Searching Problems","authors":"Andrea Clemnti, J. Rolim, L. Kucera","doi":"10.1090/dimacs/022/02","DOIUrl":"https://doi.org/10.1090/dimacs/022/02","url":null,"abstract":"","PeriodicalId":336054,"journal":{"name":"Parallel Processing of Discrete Optimization Problems","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129996389","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
A Parallel Algorithm for Computing all Homomorphisms of Deterministic Finite Automata 计算确定性有限自动机所有同态的并行算法
Parallel Processing of Discrete Optimization Problems Pub Date : 1900-01-01 DOI: 10.1090/dimacs/022/10
B. Mikolajczak
{"title":"A Parallel Algorithm for Computing all Homomorphisms of Deterministic Finite Automata","authors":"B. Mikolajczak","doi":"10.1090/dimacs/022/10","DOIUrl":"https://doi.org/10.1090/dimacs/022/10","url":null,"abstract":"","PeriodicalId":336054,"journal":{"name":"Parallel Processing of Discrete Optimization Problems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130733271","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
On Irregular Data Structures and Asynchronous Parallel Brand and Bound Algorithms 非规则数据结构与异步并行标记定界算法
Parallel Processing of Discrete Optimization Problems Pub Date : 1900-01-01 DOI: 10.1090/dimacs/022/14
C. Roucairol
{"title":"On Irregular Data Structures and Asynchronous Parallel Brand and Bound Algorithms","authors":"C. Roucairol","doi":"10.1090/dimacs/022/14","DOIUrl":"https://doi.org/10.1090/dimacs/022/14","url":null,"abstract":"","PeriodicalId":336054,"journal":{"name":"Parallel Processing of Discrete Optimization Problems","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122810554","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Sclability of Massively Parallel Depth-First Search 大规模并行深度优先搜索的可伸缩性
Parallel Processing of Discrete Optimization Problems Pub Date : 1900-01-01 DOI: 10.1090/dimacs/022/13
A. Reinefeld
{"title":"Sclability of Massively Parallel Depth-First Search","authors":"A. Reinefeld","doi":"10.1090/dimacs/022/13","DOIUrl":"https://doi.org/10.1090/dimacs/022/13","url":null,"abstract":"We analyze and compare the scalability of two generic schemes for heuristic depthrst search on highly parallel MIMD systems. The rst one employs a task attraction mechanism where the work packets are generated on demand by splitting the donor's stack. Analytical and empirical analyses show that this stack-splitting scheme works e ciently on parallel systems with a small communication diameter and a moderate number of processing elements. The second scheme, search-frontier splitting, also employs a task attraction mechanism, but uses pre-computed work packets taken from a search-frontier level of the tree. At the beginning, a search-frontier is generated and stored in the local memories. Then, the processors expand the subtrees of their frontier nodes, communicating only when they run out of work or a solution has been found. Empirical results obtained on a 32 32 = 1024 node MIMD system indicate that the search-frontier splitting scheme incurs fewer overheadsand scales better than stack-splitting on large message-passing systems. Best results were obtained with an iterative-deepening variant that improves the work-load balance from one iteration to the next.","PeriodicalId":336054,"journal":{"name":"Parallel Processing of Discrete Optimization Problems","volume":"275 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133826858","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Proving Correctness for Balancing Networks 证明平衡网络的正确性
Parallel Processing of Discrete Optimization Problems Pub Date : 1900-01-01 DOI: 10.1090/dimacs/022/01
C. Busch, M. Mavronicolas
{"title":"Proving Correctness for Balancing Networks","authors":"C. Busch, M. Mavronicolas","doi":"10.1090/dimacs/022/01","DOIUrl":"https://doi.org/10.1090/dimacs/022/01","url":null,"abstract":"","PeriodicalId":336054,"journal":{"name":"Parallel Processing of Discrete Optimization Problems","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124092098","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
A Multistage Approach for Scheduling Task Graphs on Parallel Machines 并行机上任务图调度的多阶段方法
Parallel Processing of Discrete Optimization Problems Pub Date : 1900-01-01 DOI: 10.1090/dimacs/022/05
A. Gerasoulis, Jia Jiao, Tao Yang
{"title":"A Multistage Approach for Scheduling Task Graphs on Parallel Machines","authors":"A. Gerasoulis, Jia Jiao, Tao Yang","doi":"10.1090/dimacs/022/05","DOIUrl":"https://doi.org/10.1090/dimacs/022/05","url":null,"abstract":"","PeriodicalId":336054,"journal":{"name":"Parallel Processing of Discrete Optimization Problems","volume":"461 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133431870","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Experiences with a Synchronous Parallel Branch and Bound Algorithm 一种同步并行分支定界算法
Parallel Processing of Discrete Optimization Problems Pub Date : 1900-01-01 DOI: 10.1090/dimacs/022/08
Per S. Laursen
{"title":"Experiences with a Synchronous Parallel Branch and Bound Algorithm","authors":"Per S. Laursen","doi":"10.1090/dimacs/022/08","DOIUrl":"https://doi.org/10.1090/dimacs/022/08","url":null,"abstract":"","PeriodicalId":336054,"journal":{"name":"Parallel Processing of Discrete Optimization Problems","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133714041","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Query Optimization and Processing in Parallel Databases 并行数据库中的查询优化与处理
Parallel Processing of Discrete Optimization Problems Pub Date : 1900-01-01 DOI: 10.1090/dimacs/022/11
Thomas M. Niccum, J. Srivastava, Bhaskar Himatsingka, Jianzhong Li
{"title":"Query Optimization and Processing in Parallel Databases","authors":"Thomas M. Niccum, J. Srivastava, Bhaskar Himatsingka, Jianzhong Li","doi":"10.1090/dimacs/022/11","DOIUrl":"https://doi.org/10.1090/dimacs/022/11","url":null,"abstract":"","PeriodicalId":336054,"journal":{"name":"Parallel Processing of Discrete Optimization Problems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128655628","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Serial & Parallel Algorithms for QSP Problems QSP问题的串行与并行算法
Parallel Processing of Discrete Optimization Problems Pub Date : 1900-01-01 DOI: 10.1090/dimacs/022/16
J. M. Smith, Kui Xu
{"title":"Serial & Parallel Algorithms for QSP Problems","authors":"J. M. Smith, Kui Xu","doi":"10.1090/dimacs/022/16","DOIUrl":"https://doi.org/10.1090/dimacs/022/16","url":null,"abstract":"","PeriodicalId":336054,"journal":{"name":"Parallel Processing of Discrete Optimization Problems","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133811149","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信