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

专用汽车最新文献

筛选
英文 中文
An approach to massively parallel call and service processing in telecommunications 电信中大规模并行呼叫和业务处理的一种方法
专用汽车 Pub Date : 1994-05-02 DOI: 10.1109/MPCS.1994.367035
V. Sinkovic, I. Lovrek
{"title":"An approach to massively parallel call and service processing in telecommunications","authors":"V. Sinkovic, I. Lovrek","doi":"10.1109/MPCS.1994.367035","DOIUrl":"https://doi.org/10.1109/MPCS.1994.367035","url":null,"abstract":"This paper deals with an approach to parallel processing in telecommunications based on fine granule decomposition of call and service handling processes. Call and service requests, as well as their representation with elementary tasks and task patterns, are described. An abstract model suitable for massively parallel processing has been disclosed.<<ETX>>","PeriodicalId":64175,"journal":{"name":"专用汽车","volume":"11 1","pages":"533-537"},"PeriodicalIF":0.0,"publicationDate":"1994-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74422187","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}
引用次数: 8
A comparison of parallel machine models from the point of view of scalability 从可扩展性的角度比较并行机模型
专用汽车 Pub Date : 1994-05-02 DOI: 10.1109/MPCS.1994.367069
M. Cosnard
{"title":"A comparison of parallel machine models from the point of view of scalability","authors":"M. Cosnard","doi":"10.1109/MPCS.1994.367069","DOIUrl":"https://doi.org/10.1109/MPCS.1994.367069","url":null,"abstract":"We compare various models of parallel machines and show that they can be classified in two classes: algorithm oriented or execution oriented. None of them are really satisfying from the user's point of view. Hence bridging models have been proposed. Contrarily to what is done in sequential where a two-level decomposition is used (programmimg-compiling), we assert that a parallel programming methodology must be based on a three-level decomposition. We define the notion of algorithms which scales on a distributed memory parallel computer. We propose such a methodology and advocate its advantages. Then we point out the main difficulties in parallel programming.<<ETX>>","PeriodicalId":64175,"journal":{"name":"专用汽车","volume":"63 1","pages":"258-267"},"PeriodicalIF":0.0,"publicationDate":"1994-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74207834","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
Stochastic modeling of multiprocessor reliability 多处理机可靠性随机建模
专用汽车 Pub Date : 1994-05-02 DOI: 10.1109/MPCS.1994.367025
C. Papadopoulos
{"title":"Stochastic modeling of multiprocessor reliability","authors":"C. Papadopoulos","doi":"10.1109/MPCS.1994.367025","DOIUrl":"https://doi.org/10.1109/MPCS.1994.367025","url":null,"abstract":"Colored Petri nets have been shown to create greatly simplified models that have many fewer places and transitions and can be applied to families of systems with minimal changes. The paper presents a modeling tool that uses a form of colored stochastic Petri nets to model the performance of fault tolerant multicomputers as resources fail. The model can be viewed as having tokens that collect to form compound tokens in a manner somewhat analogous to the formation of molecules from atoms. Therefore we call it the Polyvalent Stochastic Petri Net (PSPN) modeling system. Using this approach simple and relatively similar models can be used for systems of varying sizes and configuration. Complex actions such as backtracking and routing around failed links in a communications system can be expressed in the transitions. Failed parts are modeled by simply removing a resource token from a place.<<ETX>>","PeriodicalId":64175,"journal":{"name":"专用汽车","volume":"13 1","pages":"620-630"},"PeriodicalIF":0.0,"publicationDate":"1994-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74279911","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
Optimal triple modular redundancy embeddings in the hypercube 超立方体中最优的三模冗余嵌入
专用汽车 Pub Date : 1994-05-02 DOI: 10.1109/MPCS.1994.367027
L. Brown, Jie Wu
{"title":"Optimal triple modular redundancy embeddings in the hypercube","authors":"L. Brown, Jie Wu","doi":"10.1109/MPCS.1994.367027","DOIUrl":"https://doi.org/10.1109/MPCS.1994.367027","url":null,"abstract":"To achieve reliability without sacrificing performance, the tasks of a computation are redundantly assigned to the processors of a hypercube multiprocessor. The computation is represented by a task interaction graph in which nodes represent tasks, and edge weights represent the amount of communication between tasks. To provide fault tolerance, each node in the graph is replaced by three nodes that act together as a triple modular redundancy (TMR) unit. We develop a formula to calculate the number of TMR units that can be supported in an n-dimensional hypercube, and a formula to calculate the distance between true TMR units. Then we give algorithms for TMR embeddings of weighted 1-level k-ary trees and unweighted rings in a hypercube. These algorithms minimize expansion, and are optimal in that they minimize dilation for a given expansion.<<ETX>>","PeriodicalId":64175,"journal":{"name":"专用汽车","volume":"5 1","pages":"600-610"},"PeriodicalIF":0.0,"publicationDate":"1994-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74298610","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
The LoGo structuring scheme for distributed shared memory systems 分布式共享内存系统的LoGo结构方案
专用汽车 Pub Date : 1994-05-02 DOI: 10.1109/MPCS.1994.367052
F. Schon
{"title":"The LoGo structuring scheme for distributed shared memory systems","authors":"F. Schon","doi":"10.1109/MPCS.1994.367052","DOIUrl":"https://doi.org/10.1109/MPCS.1994.367052","url":null,"abstract":"In page based distributed shared memory systems false sharing is caused by locating several consistency units into the same transportation unit. We introduce a structuring scheme which combines the transparent access model known from the shared memory approach and the knowledge of discrete events to make data consistent from the message passing approach. The local-global (LoGo) scheme switches between global and local modes, corresponding to consistent and non-consistent states. It allows the incorporation of specialized protocols to reflect different access pattern categories, as e.g. multiple-writer schemes. The merging algorithm and its variants and simplifications circumvents any data type restrictions and reduces the runtime costs significant.<<ETX>>","PeriodicalId":64175,"journal":{"name":"专用汽车","volume":"10 1","pages":"408-412"},"PeriodicalIF":0.0,"publicationDate":"1994-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90666521","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
The Paprica massively parallel processor 非洲大规模并行处理器
专用汽车 Pub Date : 1994-05-02 DOI: 10.1109/MPCS.1994.367020
A. Broggi, G. Conte, F. Gregoretti, C. Sansoè, L. Reyneri
{"title":"The Paprica massively parallel processor","authors":"A. Broggi, G. Conte, F. Gregoretti, C. Sansoè, L. Reyneri","doi":"10.1109/MPCS.1994.367020","DOIUrl":"https://doi.org/10.1109/MPCS.1994.367020","url":null,"abstract":"This paper describes a complete 6-year project, starting from its theoretical basis up to the hardware and software system implementation, and to the description of its future evolution. The main goal of the project is to develop a subsystem that operates as a processing unit attached to a standard workstation and in perspective as a low-cost low-sized specialized embedded system devoted to low level image analyses and cellular neural networks emulation. The architecture has been extensively used for basic low level image analysis tasks up to optical flow computation and feature tracking, showing encouraging performances even in the first prototype version.<<ETX>>","PeriodicalId":64175,"journal":{"name":"专用汽车","volume":"58 1","pages":"16-30"},"PeriodicalIF":0.0,"publicationDate":"1994-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83121366","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}
引用次数: 36
A data parallel approach to Boolean function manipulation using BDDs 使用bdd进行布尔函数操作的数据并行方法
专用汽车 Pub Date : 1994-05-02 DOI: 10.1109/MPCS.1994.367081
G. Cabodi, S. Gai, M. Rebaudengo, M. Sonza Reorda
{"title":"A data parallel approach to Boolean function manipulation using BDDs","authors":"G. Cabodi, S. Gai, M. Rebaudengo, M. Sonza Reorda","doi":"10.1109/MPCS.1994.367081","DOIUrl":"https://doi.org/10.1109/MPCS.1994.367081","url":null,"abstract":"The paper describes an Electronic CAD package exploiting the CM-200 architecture to manipulate boolean functions. The package exploits Binary Decision Diagrams (BDDs) to symbolically operate with boolean functions. The data parallel approach is based on distributing BDD nodes do the available Processing Elements and traversing BDDs in a breadth-first manner. The behaviour of the algorithm is studied and the results which have been obtained obtained for an application developed with the package are reported. They show that the approach exploits well the parallel hardware and is highly scalable; if implemented on state-of-the-art and fully configured systems, it could solve problems which can not be faced with conventional architectures.<<ETX>>","PeriodicalId":64175,"journal":{"name":"专用汽车","volume":"1 1","pages":"163-175"},"PeriodicalIF":0.0,"publicationDate":"1994-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85474133","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
Workshop on parallel and distributed spatial data structures (P-SPADS) 并行和分布式空间数据结构研讨会(P-SPADS)
专用汽车 Pub Date : 1994-05-02 DOI: 10.1109/MPCS.1994.367073
E. Nardelli
{"title":"Workshop on parallel and distributed spatial data structures (P-SPADS)","authors":"E. Nardelli","doi":"10.1109/MPCS.1994.367073","DOIUrl":"https://doi.org/10.1109/MPCS.1994.367073","url":null,"abstract":"The main objective of this workshop is to investigate parallel and distributed architectures, algorithms and data structures for the processing of spatial data. The aim is to identify advantages and disadvantages of the different combinations of hard and soft technologies for different classes of applications.<<ETX>>","PeriodicalId":64175,"journal":{"name":"专用汽车","volume":"85 1","pages":"221-222"},"PeriodicalIF":0.0,"publicationDate":"1994-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80830735","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
Experimental evaluation of affine schedules for matrix multiplication on the MasPar architecture MasPar体系结构上矩阵乘法仿射调度的实验评价
专用汽车 Pub Date : 1994-05-02 DOI: 10.1109/MPCS.1994.367045
Pierre Boulet, J. Fortes
{"title":"Experimental evaluation of affine schedules for matrix multiplication on the MasPar architecture","authors":"Pierre Boulet, J. Fortes","doi":"10.1109/MPCS.1994.367045","DOIUrl":"https://doi.org/10.1109/MPCS.1994.367045","url":null,"abstract":"This paper reports an experimental study on the suitability of systolic algorithm scheduling methods to the automatic parallelization of algorithms on SIMD computers. We consider the matrix multiplication on the MasPar MP-1 architecture. We comparatively study different scheduling methods and the blocking of the best resulting algorithms.<<ETX>>","PeriodicalId":64175,"journal":{"name":"专用汽车","volume":"33 1","pages":"452-459"},"PeriodicalIF":0.0,"publicationDate":"1994-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90987133","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
Architecture and realization of the modular expandable multiprocessor system MEMSY 模块化可扩展多处理器系统MEMSY的体系结构与实现
专用汽车 Pub Date : 1994-05-02 DOI: 10.1109/MPCS.1994.367021
M. Dal Cin, W. Hohl, S. Dalibor, T. Eckert, A. Grygier, H. Hessenauer, U. Hildebrand, J. Honig, F. Hofmann, C. Linster, E. Michel, A. Pataricza, V. Sieh, T. Thiel, S. Turowski
{"title":"Architecture and realization of the modular expandable multiprocessor system MEMSY","authors":"M. Dal Cin, W. Hohl, S. Dalibor, T. Eckert, A. Grygier, H. Hessenauer, U. Hildebrand, J. Honig, F. Hofmann, C. Linster, E. Michel, A. Pataricza, V. Sieh, T. Thiel, S. Turowski","doi":"10.1109/MPCS.1994.367021","DOIUrl":"https://doi.org/10.1109/MPCS.1994.367021","url":null,"abstract":"The experimental multiprocessor system MEMSY is described. This system was built to validate the concept of a scalable multiprocessor architecture based on local shared-memory. Main application areas are scientific computations with high demand for processing power and memory capacity. In designing the hardware architecture the extensive use of standard components and fault tolerance were prerequisites. The programming model of MEMSY is custom made reflecting its true hardware structure whereas the operating system is a Unix extension.<<ETX>>","PeriodicalId":64175,"journal":{"name":"专用汽车","volume":"16 1","pages":"7-15"},"PeriodicalIF":0.0,"publicationDate":"1994-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86491312","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}
引用次数: 14
首页 上一页 下一页 尾页
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学术官方微信