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

[1991 Proceedings] Tenth Annual International Phoenix Conference on Computers and Communications最新文献

筛选
英文 中文
Performance modeling and enhancement in real-time data flow architectures 实时数据流架构中的性能建模和增强
[1991 Proceedings] Tenth Annual International Phoenix Conference on Computers and Communications Pub Date : 1991-03-27 DOI: 10.1109/PCCC.1991.113784
S. Som, J. Stoughton, R. Mielke
{"title":"Performance modeling and enhancement in real-time data flow architectures","authors":"S. Som, J. Stoughton, R. Mielke","doi":"10.1109/PCCC.1991.113784","DOIUrl":"https://doi.org/10.1109/PCCC.1991.113784","url":null,"abstract":"The authors are concerned with performance modeling and enhancement for periodic execution of large-grain, decision-free algorithms in data flow architectures operating in real-time. The mapping of real-time algorithms onto data flow architectures is realized by a marked graph model called ATAMM (algorithm to architecture mapping model). Applications include control, surveillance, and signal processing problems. Performance is characterized by computing speed and throughput. Bounds on performance measures are established. A technique for transforming an algorithm to improve throughput while maintaining input-output equivalence is presented. The state equations of a linear time invariant system are modified to illustrate the throughput enhancement technique.<<ETX>>","PeriodicalId":270677,"journal":{"name":"[1991 Proceedings] Tenth Annual International Phoenix Conference on Computers and Communications","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114991221","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
An annotation system for VLSI design VLSI设计中的标注系统
[1991 Proceedings] Tenth Annual International Phoenix Conference on Computers and Communications Pub Date : 1991-03-27 DOI: 10.1109/PCCC.1991.113890
T. Chiueh, R. Katz
{"title":"An annotation system for VLSI design","authors":"T. Chiueh, R. Katz","doi":"10.1109/PCCC.1991.113890","DOIUrl":"https://doi.org/10.1109/PCCC.1991.113890","url":null,"abstract":"Two areas are identified in which automatic schemes can be developed to alleviate the integration problem in developing an electronic system for CAD tools: consistency maintenance and annotation. The authors develop an annotation facility that supports annotations at different levels of details: object-level documentation, characteristics summary, and sub-object annotations. A novel sub-object annotation model called the transparency model is developed that allows arbitrary annotations to be attached to arbitrary portions of the design objects. Furthermore, this annotation facility can be used to annotate objects of various design representations. A monitor subsystem that can detect possible inconsistency between the designs and the annotations is built into the annotation system to notify users of potentially stale annotations.<<ETX>>","PeriodicalId":270677,"journal":{"name":"[1991 Proceedings] Tenth Annual International Phoenix Conference on Computers and Communications","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116804223","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
Two-dimensional polynomial interpolation from nonuniform samples 非均匀样本的二维多项式插值
[1991 Proceedings] Tenth Annual International Phoenix Conference on Computers and Communications Pub Date : 1991-03-27 DOI: 10.1109/PCCC.1991.113855
A. Zakhor
{"title":"Two-dimensional polynomial interpolation from nonuniform samples","authors":"A. Zakhor","doi":"10.1109/PCCC.1991.113855","DOIUrl":"https://doi.org/10.1109/PCCC.1991.113855","url":null,"abstract":"A number of results are presented concerning sufficient conditions under which the two-dimensional (2-D) polynomial interpolation problem has a unique or nonunique solution. It is found that unless an appropriate number of interpolation points are chosen on an appropriate number of irreducible curves, the resulting problem might become singular. Specifically, if the sum of the degrees of the irreducible curves on which the interpolation points are chosen is small compared to the degree of the interpolating polynomial, then the problem becomes singular. Similarly, if there are too many points on any of the irreducible curves on which the interpolation points are chosen, the interpolation problem runs into singularity. Examples of geometric distributions of interpolation points satisfying these conditions are shown. The examples include polynomial interpolation of polar samples, and samples on straight lines. The author proposes a recursive algorithm for a class of interpolation points.<<ETX>>","PeriodicalId":270677,"journal":{"name":"[1991 Proceedings] Tenth Annual International Phoenix Conference on Computers and Communications","volume":"2008 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127315612","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
Derivation of executable code from formal protocol specifications written in LOTOS 从用LOTOS编写的正式协议规范派生可执行代码
[1991 Proceedings] Tenth Annual International Phoenix Conference on Computers and Communications Pub Date : 1991-03-27 DOI: 10.1109/PCCC.1991.113832
A. Valenzano, R. Sisto, L. Ciminiera
{"title":"Derivation of executable code from formal protocol specifications written in LOTOS","authors":"A. Valenzano, R. Sisto, L. Ciminiera","doi":"10.1109/PCCC.1991.113832","DOIUrl":"https://doi.org/10.1109/PCCC.1991.113832","url":null,"abstract":"A novel tool for generating implementation prototypes of communication protocols and concurrent systems specified using the ISO LOTOS language is presented. LOTOS specifications are analyzed and translated into C functions that are executed by cooperating processes in the UNIX environment. The set of LOTOS process definitions is first translated into a suitable number of extended finite state machines (EFSMs). The proposed method makes it possible to circumvent the problem of deriving unbounded EFSMs and to obtain a sort of control on the process number/size tradeoff at the same time. The problem of implementing the LOTOS multi-way rendezvous mechanism for process synchronization is solved by an algorithm based on message passing. An example of prototype derivation is also introduced showing the form of C code generated by translating a simple specification.<<ETX>>","PeriodicalId":270677,"journal":{"name":"[1991 Proceedings] Tenth Annual International Phoenix Conference on Computers and Communications","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125028928","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
Network partition and its application to distributed selection problem 网络划分及其在分布式选择问题中的应用
[1991 Proceedings] Tenth Annual International Phoenix Conference on Computers and Communications Pub Date : 1991-03-27 DOI: 10.1109/PCCC.1991.113811
J. Hu, Shin-Nine Yang, Maw-Sheng Chern
{"title":"Network partition and its application to distributed selection problem","authors":"J. Hu, Shin-Nine Yang, Maw-Sheng Chern","doi":"10.1109/PCCC.1991.113811","DOIUrl":"https://doi.org/10.1109/PCCC.1991.113811","url":null,"abstract":"The authors discuss the network partition and the distributed selection problems for a general tree network. The distributed selection problem is to select the k-th smallest element of a set N of elements distributed among nodes of a point-to-point asynchronous communication network. The distributed algorithms considered are primarily message driven. All the messages have a fixed length, and may carry only a limited amount of information. The authors assume the network is sufficiently reliable so that the messages sent in a link are received error free by the receiver node in first-in-first-out (FIFO) order with finite but totally unpredictable delays. The authors present an improved selection algorithm for general tree networks. Based on the conventional reduction strategy, they introduce a tree partition technique to localize the message passing and therefore to reduce the total message complexity.<<ETX>>","PeriodicalId":270677,"journal":{"name":"[1991 Proceedings] Tenth Annual International Phoenix Conference on Computers and Communications","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125034951","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
An interaction environment supporting the retrievability of reusable software components 支持可重用软件组件的可检索性的交互环境
[1991 Proceedings] Tenth Annual International Phoenix Conference on Computers and Communications Pub Date : 1991-03-27 DOI: 10.1109/PCCC.1991.113824
P. D. Felice, Maurizio Properzi
{"title":"An interaction environment supporting the retrievability of reusable software components","authors":"P. D. Felice, Maurizio Properzi","doi":"10.1109/PCCC.1991.113824","DOIUrl":"https://doi.org/10.1109/PCCC.1991.113824","url":null,"abstract":"The card-based system presented is appropriate for supporting the reuse of code and test cases with respect to small size software projects. EasyCard is a system tailored for running on personal computers. Such a system provides the user with an easy to use interaction environment where the user can enter into and retrieve from a library information about available software components. Specifically, EasyCard features a screen-frame-based data acquisition facility, a graphical query language for retrieving information about software components, and, finally, a browsing environment suitable to explore the retrieved information. Visual feedback about the current status of the exploration prevents programmer's disorientation.<<ETX>>","PeriodicalId":270677,"journal":{"name":"[1991 Proceedings] Tenth Annual International Phoenix Conference on Computers and Communications","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115332476","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
Resilient memory-resident data objects 弹性内存驻留数据对象
[1991 Proceedings] Tenth Annual International Phoenix Conference on Computers and Communications Pub Date : 1991-03-27 DOI: 10.1109/PCCC.1991.113804
J. Paris, D. Long
{"title":"Resilient memory-resident data objects","authors":"J. Paris, D. Long","doi":"10.1109/PCCC.1991.113804","DOIUrl":"https://doi.org/10.1109/PCCC.1991.113804","url":null,"abstract":"The authors investigate the feasibility of replicated data objects consisting of several memory-resident replicas backed-up by a single append-only long maintained on disk. First, it is shown that such objects can be managed by simple variants of the most popular replication control protocols for disk-resident replicated objects. Second, under standard Markovian hypotheses, the availability of replicated objects consisting of memory-resident replicas and a single append-only log on disk are analyzed and shown that they have almost the same availability as replicated objects having all their replicas residing on disk. Using memory-resident replicas has the advantage of faster access over disk-resident replicas. The cost is an increase in recovery time to reconstruct from the log. The authors suggest several improvements that could be made to speed the recovery of the protocols. The analysis demonstrates that memory-resident replicas provide a level of fault-tolerance comparable to disk-resident replicas.<<ETX>>","PeriodicalId":270677,"journal":{"name":"[1991 Proceedings] Tenth Annual International Phoenix Conference on Computers and Communications","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115474043","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
A stepwise recognition method of library cataloging cards on the basis of various kinds of knowledge 一种基于各类知识的图书馆编目卡分步识别方法
[1991 Proceedings] Tenth Annual International Phoenix Conference on Computers and Communications Pub Date : 1991-03-27 DOI: 10.1109/PCCC.1991.113900
T. Watanabe, Q. Luo, T. Yoshida, Y. Inagaki
{"title":"A stepwise recognition method of library cataloging cards on the basis of various kinds of knowledge","authors":"T. Watanabe, Q. Luo, T. Yoshida, Y. Inagaki","doi":"10.1109/PCCC.1991.113900","DOIUrl":"https://doi.org/10.1109/PCCC.1991.113900","url":null,"abstract":"An experimental method is proposed for extracting individual data items from library cataloging cards and classify them into the cataloging item classes automatically. The basic idea for the recognition strategy is to utilize various kinds of knowledge stepwise on the basis the generation/verification process of object hypotheses. In this approach, such knowledge as layout information of card structures, relationship information among cataloging items, and property information of data items is effectual. The knowledge is not represented as same-level information, but is mutually specified with the hierarchical relationship. Lower-level knowledge is successful for recognizing the processing objects interpreted by higher-level knowledge. Though the authors' primary concern is about the understanding of library cataloging cards, the proposed framework is applicable to other documents with particular layout structures such as pamphlets, letters, office mail, office documents, articles, papers and so on.<<ETX>>","PeriodicalId":270677,"journal":{"name":"[1991 Proceedings] Tenth Annual International Phoenix Conference on Computers and Communications","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122307022","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}
引用次数: 10
An efficient distributed algorithm for minimal connected dominating set problem 最小连通控制集问题的一种高效分布式算法
[1991 Proceedings] Tenth Annual International Phoenix Conference on Computers and Communications Pub Date : 1991-03-27 DOI: 10.1109/PCCC.1991.113812
Ji-Cherng Lin, Shin-Nine Yang, Maw-Sheng Chern
{"title":"An efficient distributed algorithm for minimal connected dominating set problem","authors":"Ji-Cherng Lin, Shin-Nine Yang, Maw-Sheng Chern","doi":"10.1109/PCCC.1991.113812","DOIUrl":"https://doi.org/10.1109/PCCC.1991.113812","url":null,"abstract":"The authors propose an efficient distributed algorithm for finding a minimal connected dominating set of an asynchronous communication network. An asynchronous communication network can be modeled by a connected undirected graph G=(V, E) where the nodes correspond to the sites and the edges correspond to bidirectional communication links. No common memory is shared by the sites. Each node receives messages from its neighbors, performs some computation, and sends messages to its neighbors. Thus the distributed algorithms considered here are primarily message driven. Furthermore, each message sent by a node is assumed to be error free and to arrive in sequence to its neighbors after an unpredictable finite delay. The worst case message complexity of the algorithm is O(n/sup 2/), where n is the number of processors of the network.<<ETX>>","PeriodicalId":270677,"journal":{"name":"[1991 Proceedings] Tenth Annual International Phoenix Conference on Computers and Communications","volume":"155 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122314892","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}
引用次数: 10
The support for a dynamic parallel object model on a transputer-based architecture 在基于传输器的架构上对动态并行对象模型的支持
[1991 Proceedings] Tenth Annual International Phoenix Conference on Computers and Communications Pub Date : 1991-03-27 DOI: 10.1109/PCCC.1991.113828
A. Ciampolini, Antonio Corradi, L. Leonardi
{"title":"The support for a dynamic parallel object model on a transputer-based architecture","authors":"A. Ciampolini, Antonio Corradi, L. Leonardi","doi":"10.1109/PCCC.1991.113828","DOIUrl":"https://doi.org/10.1109/PCCC.1991.113828","url":null,"abstract":"It is shown how a parallel object model can be used as a support environment for massively parallel architectures based on transputer technology. The intention is to verify that parallelism integrates well with such properties of the object paradigm as abstraction, uniformity, and dynamicity. The authors also present the guidelines to build prototypes by an approach based on primitives. In particular, the implemented primitives make possible the creation and communication of objects for a massively parallel architecture. Finally, trends in future work-static and dynamic allocation, replication and persistency of objects-are outlined.<<ETX>>","PeriodicalId":270677,"journal":{"name":"[1991 Proceedings] Tenth Annual International Phoenix Conference on Computers and Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122477321","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}
引用次数: 9
下一页 尾页
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学术官方微信