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

Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications最新文献

筛选
英文 中文
Real-time classification of chromosomes in slit scan flow cytometry using NERV-a MIMD supercomputer 利用nerva - MIMD超级计算机进行狭缝扫描流式细胞术中染色体的实时分类
Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications Pub Date : 1990-03-07 DOI: 10.1109/PARBSE.1990.77229
P. Zuse, R. Hauser, R. Manner, M. Hausmann, C. Cremer
{"title":"Real-time classification of chromosomes in slit scan flow cytometry using NERV-a MIMD supercomputer","authors":"P. Zuse, R. Hauser, R. Manner, M. Hausmann, C. Cremer","doi":"10.1109/PARBSE.1990.77229","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77229","url":null,"abstract":"Presently, profile evaluation can be done at a rate of 10 chromosomes/s using the reflection algorithm. To measure, for example, radiation-induced aberrations in the low dose range or to sort chromosomes according to their slit scan data, it is desired that the analysis speed increase by a factor of 100. It is shown that the data analysis rate allowed by the on-line computer may be increased by implementing the analysis algorithm on a multiprocessor system consisting of 60 microprocessors. The authors discuss an evaluation done on a parallel processing system that may consist of a high number (<or=320) of 32-b microprocessors (NERV). The NERV system was developed as a prototype with a small number of slave processors. Its hardware has been tested completely.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122761749","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
Database design according to user views 根据用户视图设计数据库
Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications Pub Date : 1990-03-07 DOI: 10.1109/PARBSE.1990.77168
G. Pernul, P. Moser, G. Luef
{"title":"Database design according to user views","authors":"G. Pernul, P. Moser, G. Luef","doi":"10.1109/PARBSE.1990.77168","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77168","url":null,"abstract":"The authors introduce a conceptual start schema, which describes a relational database schema and contains a set of relational schemata, a set of inter- and intrarelational dependencies, and a set of user views. It is shown how the start schema can be decomposed into fragments according to the dependencies between different object types, according to dependencies between attributes, and according to the different user views. Fragments are represented by RM/T-relations in 4NF. The model itself is extended by catalog relations to represent metainformation about relations, relationships, and user views. Furthermore, some suggestions on how to represent the semantics of user views are given.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123270664","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 fault-tolerant broadcasting algorithm for a cube-connected cycles multiprocessor 立方体连接循环多处理器的最优容错广播算法
Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications Pub Date : 1990-03-07 DOI: 10.1109/PARBSE.1990.77142
J. E. Jang
{"title":"An optimal fault-tolerant broadcasting algorithm for a cube-connected cycles multiprocessor","authors":"J. E. Jang","doi":"10.1109/PARBSE.1990.77142","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77142","url":null,"abstract":"The author develops a novel broadcasting algorithm in cube-connected-cycles (CCC) multiprocessors using a binomial tree. The initiating processor takes (h-1/2)+s (1+(h-1/2)) steps to broadcast the message to all other processors. The proposed broadcasting algorithm is a procedure by which a processor can pass a message to all other processors in the network nonredundantly: it is extremely important for diagnosis of the network, distribution agreement, or clock synchronization. The author also describes an optimal fault-tolerant broadcasting algorithm in the CCC which tolerates s-1 processors or s-1 ring failures. The algorithm takes 1+2* ((h-1/2))+s(1+(h-1/2)) steps to broadcast the message to all other processors in optimal fault-tolerant broadcasting.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128993246","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
Scheduling on parallel processing systems using parallel primitives 使用并行原语的并行处理系统调度
Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications Pub Date : 1990-03-07 DOI: 10.1109/PARBSE.1990.77117
Hyeong-Ah Choi, B. Narahari, S. Rotenstreich, Abdou Youssef
{"title":"Scheduling on parallel processing systems using parallel primitives","authors":"Hyeong-Ah Choi, B. Narahari, S. Rotenstreich, Abdou Youssef","doi":"10.1109/PARBSE.1990.77117","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77117","url":null,"abstract":"An approach for integrating task and parallel architecture characteristics is presented, with the objectives of easing the burden of parallel programming on the user and of increasing the system efficiency through more informed embedding, partitioning, and scheduling. The proposed approach uses the concepts of parallel primitives and a primitives table that serves as the knowledge base for the system. Parallel primitives are parallel SIMD computations and can be used to write parallel programs. The primitives table stores the specifications of each primitive. In addition, for each primitive several alternative implementations corresponding to alternative network structures are provided and stored in the table. A layered implementation of a parallel processing system with parallel primitives is presented. The authors also examine the positive implications of the primitives table on scheduling, as well as on determining the optimal machine configurations for tasks using precedence graphs. The latter problem is shown to be NP-complete. However, a linear algorithm is found for the case in which the precedence graph is a tree.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126615084","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
Massively parallel implementation of two operations: unification and inheritance 两个操作的大规模并行实现:统一和继承
Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications Pub Date : 1990-03-07 DOI: 10.1109/PARBSE.1990.77189
C. Constantinescu
{"title":"Massively parallel implementation of two operations: unification and inheritance","authors":"C. Constantinescu","doi":"10.1109/PARBSE.1990.77189","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77189","url":null,"abstract":"The author develops two algorithms for a massively parallel system, and SIMD (single instruction, multiple data) computer with a general and fast communication network. Each of the two operations (unification and inheritance) is basic for one knowledge representation scheme. Both take data represented by directed graphs. For ease of integration in real systems and naturalness of specification, the operations are implemented incrementally, in the spirit of M.R. Quillian's 'spreading activation', and not as atomic operations. The running time of both algorithms is almost linear in the number of vertices on the longest path in the graph representation. The association of the two operations is not accidental; the author intends to integrate them in a hybrid reasoning system.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125465866","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
On the design, implementation, and evaluation of a portable parallel database system 便携式并行数据库系统的设计、实现与评估
Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications Pub Date : 1990-03-07 DOI: 10.1109/PARBSE.1990.77192
O. Frieder, P. Jackson
{"title":"On the design, implementation, and evaluation of a portable parallel database system","authors":"O. Frieder, P. Jackson","doi":"10.1109/PARBSE.1990.77192","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77192","url":null,"abstract":"The authors describe a complete implementation and evaluation of a parallel relational database system. The described implementation exploits parallel algorithms initially proposed for a hypercube to achieve its speedup. Specifically, attention is given to a portable parallel database system that exploits both parallel algorithms and data parallelism to expedite database processing. Two join algorithms are evaluated. It is shown that, for joins with a comparable number of tuples in each of the two joining relations, a bucket-based approach is preferable. However, if the two relations greatly differ in size, a broadcast-based approach is preferred.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128471175","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
Structured data in structured logic programming environment 结构化逻辑编程环境中的结构化数据
Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications Pub Date : 1990-03-07 DOI: 10.1109/PARBSE.1990.77213
S. Nurcan, J. Kouloumdjian
{"title":"Structured data in structured logic programming environment","authors":"S. Nurcan, J. Kouloumdjian","doi":"10.1109/PARBSE.1990.77213","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77213","url":null,"abstract":"EPSILON, a prototype developed in the context of the European ESPRIT project, is discussed. It is built on top of a commercial Prolog and DBMS (database management system) running on standard UNIX environment. The EPSILON logic programming environment allows the structuring of large knowledge bases expressed in logic languages using so-called theories. The integration of different object-oriented concepts into the current EPSILON prototype provides an environment offering the user object-oriented concepts at different levels. First, the theory concept itself is an object-oriented mechanism to structure logic programs. Second, implementing logic languages, including object-oriented concepts (type hierarchies, nested data structures, etc.), by metaprogramming provided by the theory concept allows the user to employ different augmented logic languages within the programming environment.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134049398","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
Will 2D meshes replace hypercubes? 2D网格会取代超立方体吗?
Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications Pub Date : 1990-03-07 DOI: 10.1109/PARBSE.1990.77127
S. Chittor, R. Enbody
{"title":"Will 2D meshes replace hypercubes?","authors":"S. Chittor, R. Enbody","doi":"10.1109/PARBSE.1990.77127","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77127","url":null,"abstract":"The authors analytically investigate and derive the speedup provided by 2-D meshes over hypercubes for several common communication patterns. They take into consideration the difference in channel widths, the communication rates, and the effect of worm-hole routing. The 2-D meshes are shown to provide significant speedups if effects of contentions can be ignored. For large networks having hundreds of nodes, contentions become significant, reducing the speedups. Appropriate mapping and routing may be used to reduce the contentions while retaining the speedups.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"39 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132854992","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
Distributed optimistic concurrency control for high performance transaction processing 用于高性能事务处理的分布式乐观并发控制
Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications Pub Date : 1990-03-07 DOI: 10.1109/PARBSE.1990.77186
Erhard Rahm, Alexander Thomasian
{"title":"Distributed optimistic concurrency control for high performance transaction processing","authors":"Erhard Rahm, Alexander Thomasian","doi":"10.1109/PARBSE.1990.77186","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77186","url":null,"abstract":"A novel optimistic concurrency control (OCC) protocol for distributed high-performance transaction systems is presented. Unlike other proposals for OCC in distributed systems, this scheme limits the number of restarts by acquiring locks to guarantee a failed transaction a successful second execution. Lock acquisition and validation are imbedded in the commit protocol in order to avoid any extra messages. Deadlocks are avoided by requesting all locks at once before performing validation. The protocol is fully distributed and employs parallel validation and lock acquisition. A main advantage compared with distributed locking schemes is that locks are held only during commit processing in general, thus considerably reducing the degree of lock contention. As first simulation results have confirmed, this is of particular benefit for high-performance transaction-processing complexes with fast processors.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115617603","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
A time-stamp based concurrency control mechanism for redundant computing systems 一种基于时间戳的冗余计算系统并发控制机制
Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications Pub Date : 1990-03-07 DOI: 10.1109/PARBSE.1990.77219
K. Saisho, Y. Kambayashi
{"title":"A time-stamp based concurrency control mechanism for redundant computing systems","authors":"K. Saisho, Y. Kambayashi","doi":"10.1109/PARBSE.1990.77219","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77219","url":null,"abstract":"The use of shuffled execution systems to construct redundant executing systems is considered. The following two problems connected with the implementation of this method are discussed: (1) how to combine normal operations and voting operations and how to return to the normal situation when voting operations fail; and (2) how to apply timestamp ordering techniques to the system model.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"127 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115737582","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学术文献互助群
群 号：604180095
Book学术官方微信