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

Proceedings Sixth International Parallel Processing Symposium最新文献

筛选
英文 中文
Scalable reader-writer locks for parallel systems 用于并行系统的可伸缩读写锁
Proceedings Sixth International Parallel Processing Symposium Pub Date : 1992-03-01 DOI: 10.1109/IPPS.1992.222989
Wilson C. Hsieh, W. Weihl
{"title":"Scalable reader-writer locks for parallel systems","authors":"Wilson C. Hsieh, W. Weihl","doi":"10.1109/IPPS.1992.222989","DOIUrl":"https://doi.org/10.1109/IPPS.1992.222989","url":null,"abstract":"Current algorithms for reader-writer synchronization do not scale for readers: readers cannot acquire locks in parallel. The authors describe two new algorithms that allow parallelism among readers during lock acquisition; this is achieved by distributing the lock state among different processors, and by trading reader throughput for writer throughput. Their experiments show that when reads are a large percentage of lock requests, the throughput of each of their algorithms scales significantly better than current algorithms.<<ETX>>","PeriodicalId":340070,"journal":{"name":"Proceedings Sixth International Parallel Processing Symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130270582","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}
引用次数: 47
Scheduling conditions for concurrent real-time readers and writers 并发实时读、写的调度条件
Proceedings Sixth International Parallel Processing Symposium Pub Date : 1992-03-01 DOI: 10.1109/IPPS.1992.223053
Min-Ih Chen, C. Han, Kwei-Jay Lin
{"title":"Scheduling conditions for concurrent real-time readers and writers","authors":"Min-Ih Chen, C. Han, Kwei-Jay Lin","doi":"10.1109/IPPS.1992.223053","DOIUrl":"https://doi.org/10.1109/IPPS.1992.223053","url":null,"abstract":"The article studies real-time systems which have a set of periodic readers and writers accessing a shared data object. The sufficient scheduling conditions for these tasks to finish their executions before the end of their periods are derived. The paper also studies a scheduling technique called job coalescence which combines many reader jobs or writer jobs into a job cluster and executes the cluster as a single job.<<ETX>>","PeriodicalId":340070,"journal":{"name":"Proceedings Sixth International Parallel Processing Symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131373448","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
Formal derivation of an efficient parallel 2-D Gauss-Seidel method 一种有效的二维高斯-赛德尔方法的形式化推导
Proceedings Sixth International Parallel Processing Symposium Pub Date : 1992-03-01 DOI: 10.1109/IPPS.1992.223046
J. A. Yang, Young-il Choo
{"title":"Formal derivation of an efficient parallel 2-D Gauss-Seidel method","authors":"J. A. Yang, Young-il Choo","doi":"10.1109/IPPS.1992.223046","DOIUrl":"https://doi.org/10.1109/IPPS.1992.223046","url":null,"abstract":"Presents a formal derivation of a highly efficient parallel implementation of the 2-D Gauss-Seidel method for machines based on the two-dimensional mesh of processors. A methodology is illustrated which formalizes the process of mapping and scheduling a high level algorithm onto a particular target parallel architecture. It starts from a simple initial program. Equational transformations are then applied: to partition the abstract problem onto processors; to make communication among processors explicit; to pipeline the computation by wave-front scheduling; and finally to map logical processors onto physical processors for perfect processor utilization. All the derivation steps preserve equalities so that the derived programs are equivalent to the initial program. Using this methodology, the paper develops efficient implementations for other parallel architectures.<<ETX>>","PeriodicalId":340070,"journal":{"name":"Proceedings Sixth International Parallel Processing Symposium","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114286666","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
Hierarchically organized Petri net state space for reachability and deadlock analysis 分层组织Petri网状态空间，用于可达性和死锁分析
Proceedings Sixth International Parallel Processing Symposium Pub Date : 1992-03-01 DOI: 10.1109/IPPS.1992.222996
Masato Notomi, T. Murata
{"title":"Hierarchically organized Petri net state space for reachability and deadlock analysis","authors":"Masato Notomi, T. Murata","doi":"10.1109/IPPS.1992.222996","DOIUrl":"https://doi.org/10.1109/IPPS.1992.222996","url":null,"abstract":"Petri nets are a versatile tool for modeling and analyzing parallel and distributed computing systems. However state explosion is a major impediment to their analysis and practical applications. To cope with this problem, this paper proposes a method for constructing hierarchically organized state space (HOSS) of a bounded Petri net. Using the HOSS, the authors obtain necessary and sufficient conditions for reachability and deadlock, and algorithms to test if a given state (marking) is reachable from the initial state and if there is a deadlock state (a state with no successor states).<<ETX>>","PeriodicalId":340070,"journal":{"name":"Proceedings Sixth International Parallel Processing Symposium","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121180466","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
Language constructs for structured parallel programming 结构化并行编程的语言结构
Proceedings Sixth International Parallel Processing Symposium Pub Date : 1992-03-01 DOI: 10.1109/IPPS.1992.223003
Zhiwei Xu, K. Hwang
{"title":"Language constructs for structured parallel programming","authors":"Zhiwei Xu, K. Hwang","doi":"10.1109/IPPS.1992.223003","DOIUrl":"https://doi.org/10.1109/IPPS.1992.223003","url":null,"abstract":"Advocates a structured style for parallel program development. It is argued that a high-quality parallel computing program should be terminating (the program always halts in finite time) and determinate (the program always produces the same result for the same input). A methodology is presented for structured parallel programming, drawing on the successful philosophies of structured sequential programming. A set of structured constructs is presented to demonstrate this methodology. Conditions for termination and determinacy are then derived, which suggests a set of rules for the development of terminating and determinate programs. Infinite waiting and indeterminacy anomalies are characterized. An algorithm is described to detect these anomalies by syntactical analysis.<<ETX>>","PeriodicalId":340070,"journal":{"name":"Proceedings Sixth International Parallel Processing Symposium","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127014242","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
Visualization of a simple routing scheme for meshes 一个简单的网格路由方案的可视化
Proceedings Sixth International Parallel Processing Symposium Pub Date : 1992-03-01 DOI: 10.1109/IPPS.1992.222998
Nelson Ge, J. Antonio, S. Vitalpur
{"title":"Visualization of a simple routing scheme for meshes","authors":"Nelson Ge, J. Antonio, S. Vitalpur","doi":"10.1109/IPPS.1992.222998","DOIUrl":"https://doi.org/10.1109/IPPS.1992.222998","url":null,"abstract":"The authors propose a simple quasi-static routing scheme for buffered mesh connected network computers. Under the assumption of uniform traffic demands, it is demonstrated numerically that their simple routing scheme achieves near-optimal performance; in the sense of minimizing the total number of outstanding packets in a Jackson-type network. Simulation results are also presented for the case of non-uniform traffic demands. These simulations illustrate that our quasi-static control scheme can dynamically adjust the values of routing probabilities so as to provide acceptable and stable network performance. The results of these simulations are displayed using advanced video graphics.<<ETX>>","PeriodicalId":340070,"journal":{"name":"Proceedings Sixth International Parallel Processing Symposium","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128598368","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
Profiling based task migration 基于分析的任务迁移
Proceedings Sixth International Parallel Processing Symposium Pub Date : 1992-03-01 DOI: 10.1109/IPPS.1992.223048
Jeff Baxter, J. Patel
{"title":"Profiling based task migration","authors":"Jeff Baxter, J. Patel","doi":"10.1109/IPPS.1992.223048","DOIUrl":"https://doi.org/10.1109/IPPS.1992.223048","url":null,"abstract":"A new task migration strategy is presented. The input program is supplied as a task graph and an initial static assignment of tasks to processors is given. The dynamic behaviour of the static allocation is then profiled, and a set of migration destinations and migration thresholds are identified. During any subsequent execution, the profiling based algorithm makes migration decisions solely on the basis of the profiled data and the local processor load. No neighboring processor load information is required. Results are presented for the algorithm, and compared against a dynamic mapping scheme with global knowledge of the multiprocessor state.<<ETX>>","PeriodicalId":340070,"journal":{"name":"Proceedings Sixth International Parallel Processing Symposium","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124055237","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
An efficient convex hull computation on the reconfigurable mesh 基于可重构网格的高效凸包计算
Proceedings Sixth International Parallel Processing Symposium Pub Date : 1992-03-01 DOI: 10.1109/IPPS.1992.223057
D. Reisis
{"title":"An efficient convex hull computation on the reconfigurable mesh","authors":"D. Reisis","doi":"10.1109/IPPS.1992.223057","DOIUrl":"https://doi.org/10.1109/IPPS.1992.223057","url":null,"abstract":"Presents a fast parallel solution to the convex hull problem on a two dimensional reconfigurable mesh. The parallel algorithm computes the convex hull of N/sup 1/2/ planar points on a N/sup 1/2/*N/sup 1/2/ reconfigurable mesh. The algorithm is very efficient and completes the convex hull computation in O(1) time. Efficient parallel sorting of N/sup 1/2/ data items on the reconfigurable mesh and improved parallel enumerating techniques utilized as basic steps in the convex hull computation are also shown.<<ETX>>","PeriodicalId":340070,"journal":{"name":"Proceedings Sixth International Parallel Processing Symposium","volume":"34 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124329352","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}
引用次数: 15
A computational model for message-passing 消息传递的计算模型
Proceedings Sixth International Parallel Processing Symposium Pub Date : 1992-03-01 DOI: 10.1109/IPPS.1992.223020
A. Sivasubramaniam, U. Ramachandran, H. Venkateswaran
{"title":"A computational model for message-passing","authors":"A. Sivasubramaniam, U. Ramachandran, H. Venkateswaran","doi":"10.1109/IPPS.1992.223020","DOIUrl":"https://doi.org/10.1109/IPPS.1992.223020","url":null,"abstract":"The article develops a framework for message-passing architectures consisting of a machine model called communicating random access machine (CRAM) and a programming paradigm. The CRAM model serves as a vehicle for the design and analysis of message-passing algorithms. The message-passing paradigm makes the mapping of algorithms that fit this paradigm onto message-passing architectures more natural.<<ETX>>","PeriodicalId":340070,"journal":{"name":"Proceedings Sixth International Parallel Processing Symposium","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123828436","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
An optimal sorting algorithm on reconfigurable mesh 可重构网格的最优排序算法
Proceedings Sixth International Parallel Processing Symposium Pub Date : 1992-03-01 DOI: 10.1109/IPPS.1992.223059
Ju-wook Jang, V. Prasanna
{"title":"An optimal sorting algorithm on reconfigurable mesh","authors":"Ju-wook Jang, V. Prasanna","doi":"10.1109/IPPS.1992.223059","DOIUrl":"https://doi.org/10.1109/IPPS.1992.223059","url":null,"abstract":"An optimal sorting algorithm on the reconfigurable mesh is proposed. The algorithm sorts n numbers in constant time using n*n processors. The best known previous result uses O(n*nlog/sup 2/n) processors. The presented algorithm satisfies the AT/sup 2/ lower bound of Omega (n/sup 2/) for sorting n numbers in the word model of VLSI. Modification to the algorithm for area-time trade-off is shown, to achieve AT/sup 2/ optimality over 1<or=T<or= square root n. Previously, the bound was achieved over log n<or=T<or= square root n.<<ETX>>","PeriodicalId":340070,"journal":{"name":"Proceedings Sixth International Parallel Processing Symposium","volume":"2016 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114787195","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}
引用次数: 139
首页 上一页 下一页 尾页
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学术官方微信