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

专用汽车最新文献

筛选
英文 中文
Technology against vision architectures 针对视觉架构的技术
专用汽车 Pub Date : 1994-05-02 DOI: 10.1109/MPCS.1994.367070
B. Zavidovique
{"title":"Technology against vision architectures","authors":"B. Zavidovique","doi":"10.1109/MPCS.1994.367070","DOIUrl":"https://doi.org/10.1109/MPCS.1994.367070","url":null,"abstract":"Understanding what the problems are in robot-vision architecture, requires a better comparison of major features. But a zoology of vision machines is questioned when, aiming for a well informed architectural feature choice, a rapid presentation of technological trends in the field is proposed. Then an approach closer to physics prompts to a classification from a control point of view: it reveals some duality between operations and communications. A few visual operations are distinguished provided technology is not trailing behind. But emphasis should be put on communication networks, although they do not show any image processing specificity currently, and the conclusion addresses some limits in that respect.<<ETX>>","PeriodicalId":64175,"journal":{"name":"专用汽车","volume":"13 1","pages":"239-257"},"PeriodicalIF":0.0,"publicationDate":"1994-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87834812","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
Conditional and iterative structures using a homogeneous static dataflow graph model 使用同构静态数据流图模型的条件和迭代结构
专用汽车 Pub Date : 1994-05-02 DOI: 10.1109/MPCS.1994.367054
L. Verdoscia, R. Vaccaro
{"title":"Conditional and iterative structures using a homogeneous static dataflow graph model","authors":"L. Verdoscia, R. Vaccaro","doi":"10.1109/MPCS.1994.367054","DOIUrl":"https://doi.org/10.1109/MPCS.1994.367054","url":null,"abstract":"This paper presents a static dataflow graph model, where only data tokens are allowed to flow. The proposed model is formally described, and the dataflow graph is obtained by employing only actors with homogeneous I/O conditions. Each actor, which executes an elemental operation, is characterized by having one output and two input arcs. Even though no control tokens are allowed, so that no T-gate, merge, and switch actors are present in this model, it is always possible to represent conditional and iterative structures whose behavior is well-behaved. As homogeneous I/O conditions are a severe restriction to represent the flow of a computation and the token flow in such dataflow graphs is completely asynchronous, proof is given to guarantee their determinacy.<<ETX>>","PeriodicalId":64175,"journal":{"name":"专用汽车","volume":"34 1","pages":"391-401"},"PeriodicalIF":0.0,"publicationDate":"1994-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90200339","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
Application specific parallel architectures 特定于应用程序的并行架构
专用汽车 Pub Date : 1994-05-02 DOI: 10.1109/MPCS.1994.367040
A. De Gloria, P. Faraboschi
{"title":"Application specific parallel architectures","authors":"A. De Gloria, P. Faraboschi","doi":"10.1109/MPCS.1994.367040","DOIUrl":"https://doi.org/10.1109/MPCS.1994.367040","url":null,"abstract":"This paper deals with the design of parallel architectures dedicated to specific applications and mainly focuses on the relationships between software and hardware tradeoffs, putting the emphasis on parallel architecture for non-numeric applications. The analysis covers both medium and massive parallelism. Medium level parallelism is seen through the analysis of VLIW architectures where code-generation takes an important role for achieving high performance. In particular we show the main design steps of a parallel architecture for Prolog. High level parallelism in non-numeric applications is introduced through the presentation of a dedicated architecture for the solution of NP-complete problems with the Boltzmann Machine model. Also in this case, we present the problems related to the design of the architecture and the interaction between hardware and software components.<<ETX>>","PeriodicalId":64175,"journal":{"name":"专用汽车","volume":"29 1","pages":"497-512"},"PeriodicalIF":0.0,"publicationDate":"1994-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81071297","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 fast algorithm for data exchange in reconfigurable tree structures 可重构树结构中数据交换的快速算法
专用汽车 Pub Date : 1994-05-02 DOI: 10.1109/MPCS.1994.367032
S. Srinivas, N. Biswas
{"title":"A fast algorithm for data exchange in reconfigurable tree structures","authors":"S. Srinivas, N. Biswas","doi":"10.1109/MPCS.1994.367032","DOIUrl":"https://doi.org/10.1109/MPCS.1994.367032","url":null,"abstract":"The paper presents a fast algorithm for data exchange in a network of processors organized as a reconfigurable tree structure. For a given data exchange table, the algorithm generates a sequence of tree configurations in which the data exchanges are to be executed. A significant feature of the algorithm is that each exchange is executed in a tree configuration in which the source and destination nodes are adjacent to each other. It has been proved in a theorem that for every pair of nodes in the reconfigurable tree structure, there always exist two and only two configurations in which these two nodes are adjacent to each other. The algorithm utilizes this fact and determines the solution so as to optimize both the number of configurations required and the time to perform the data exchanges. Analysis of the algorithm shows that it has linear lime complexity, and provides a large reduction in run-time as compared to an existing algorithm. This is well confirmed from the experimental results obtained by executing a large number of randomly generated data exchange tables. Another significant feature of the algorithm is that the bit size of the routing information code is always two bits, irrespective of the number of nodes in the tree. This not only increases the speed of the algorithm but also results in simpler hardware inside each node.<<ETX>>","PeriodicalId":64175,"journal":{"name":"专用汽车","volume":"16 1","pages":"554-563"},"PeriodicalIF":0.0,"publicationDate":"1994-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79852233","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 symbolic language for vision analysis 一种用于视觉分析的平行符号语言
专用汽车 Pub Date : 1994-05-02 DOI: 10.1109/MPCS.1994.367038
M. Giordano, M. Furnari, A. Massarotti
{"title":"A parallel symbolic language for vision analysis","authors":"M. Giordano, M. Furnari, A. Massarotti","doi":"10.1109/MPCS.1994.367038","DOIUrl":"https://doi.org/10.1109/MPCS.1994.367038","url":null,"abstract":"In this paper we describe the design criteria for a Parallel Symbolic Language for Vision Analysis. The essential feature of a such language is the use of the notion of structured parallelism in order to capture all the forms of parallelism used in vision analysis. After introducing the need for Symbolic Parallel languages for the vision analysis, we show how PARALATION LISP can be extended to manage it in a user transparent way. Then, we describe the design criteria used for our Parallel Symbolic Vision Analysis Language project and the current implementation status.<<ETX>>","PeriodicalId":64175,"journal":{"name":"专用汽车","volume":"262 1","pages":"518-522"},"PeriodicalIF":0.0,"publicationDate":"1994-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79668946","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
Communication in distributed computing environments 分布式计算环境中的通信
专用汽车 Pub Date : 1994-05-02 DOI: 10.1109/MPCS.1994.367090
A.M. Sjostrom
{"title":"Communication in distributed computing environments","authors":"A.M. Sjostrom","doi":"10.1109/MPCS.1994.367090","DOIUrl":"https://doi.org/10.1109/MPCS.1994.367090","url":null,"abstract":"Computing is often viewed as a tool and a computing system is typically treated as a toolbox of applications for performing operations such as calculations and data storage and transfer. Currently, humans develop these application tools and apply, or specify how to apply, them. Recognizing that computing is a fundamental discipline challenges us to accept the notion that a computing system could play other roles than merely serving as a toolbox. An active player will require massive parallelism and mechanisms for abstracting over interactions.<<ETX>>","PeriodicalId":64175,"journal":{"name":"专用汽车","volume":"33 4 1","pages":"78-83"},"PeriodicalIF":0.0,"publicationDate":"1994-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89938811","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
Performance implications of task routing and task scheduling strategies for multiprocessor systems 多处理器系统中任务路由和任务调度策略的性能影响
专用汽车 Pub Date : 1994-05-02 DOI: 10.1109/MPCS.1994.367059
S. Dandamudi
{"title":"Performance implications of task routing and task scheduling strategies for multiprocessor systems","authors":"S. Dandamudi","doi":"10.1109/MPCS.1994.367059","DOIUrl":"https://doi.org/10.1109/MPCS.1994.367059","url":null,"abstract":"In distributed task ready queue organizations, task routing refers to how ready tasks are assigned to processors in the system and task scheduling refers to how these tasks are scheduled on the assigned processor. In this paper, we consider the interaction between task routing and task scheduling strategies and their impact on the performance of the distributed task queue organization. We consider four task routing strategies two adaptive and two non-adaptive-and five task scheduling policies-two preemptive and three run-to-completion policies. We show that, when adaptive task routing is employed, the scheduling policy has only a marginal impact on performance and preemptive round robin policies tend to perform worse than the FCFS policy.<<ETX>>","PeriodicalId":64175,"journal":{"name":"专用汽车","volume":"51 1","pages":"348-353"},"PeriodicalIF":0.0,"publicationDate":"1994-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72713066","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}
引用次数: 25
Improved bounds on linear size expander 改进了线性尺寸扩展器的边界
专用汽车 Pub Date : 1994-05-02 DOI: 10.1109/MPCS.1994.367088
B. Park
{"title":"Improved bounds on linear size expander","authors":"B. Park","doi":"10.1109/MPCS.1994.367088","DOIUrl":"https://doi.org/10.1109/MPCS.1994.367088","url":null,"abstract":"Linear size expanders have been studied in many fields for their practical use, which is the possibility to connect large numbers of device chips in parallel communication systems. One of the critical points in parallel computer designs has been very high cost of communication between processors and memories. Currently, linear size expanders can be used to construct theoretically optimal interconnection networks with reducing large constant factors. This paper presents an improvement on constructing concentrators using an (n, k, 2rs)/(r/sup 2/-s/sup 2/) expander, which realizes the reduction of the size in a superconcentrator by a constant factor.<<ETX>>","PeriodicalId":64175,"journal":{"name":"专用汽车","volume":"40 1","pages":"96-101"},"PeriodicalIF":0.0,"publicationDate":"1994-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78310798","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
SELF-TIMING-tools for hardware support of parallel, concurrent and event-driven process control 用于硬件支持并行、并发和事件驱动过程控制的自定时工具
专用汽车 Pub Date : 1994-05-02 DOI: 10.1109/MPCS.1994.367043
V. Varshavsky, T. Chu
{"title":"SELF-TIMING-tools for hardware support of parallel, concurrent and event-driven process control","authors":"V. Varshavsky, T. Chu","doi":"10.1109/MPCS.1994.367043","DOIUrl":"https://doi.org/10.1109/MPCS.1994.367043","url":null,"abstract":"After describing the main idea of self-timing, the authors consider the advantages and costs of the application of self-timing. They discuss the synchronisation of processes in self-timed systems.<<ETX>>","PeriodicalId":64175,"journal":{"name":"专用汽车","volume":"329 1","pages":"472-476"},"PeriodicalIF":0.0,"publicationDate":"1994-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75323390","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
Avoiding memory contention on tightly coupled multiprocessors 避免紧耦合多处理器上的内存争用
专用汽车 Pub Date : 1994-05-02 DOI: 10.1109/MPCS.1994.367023
M. Valerio, L. Moser, P. Melliar-Smith
{"title":"Avoiding memory contention on tightly coupled multiprocessors","authors":"M. Valerio, L. Moser, P. Melliar-Smith","doi":"10.1109/MPCS.1994.367023","DOIUrl":"https://doi.org/10.1109/MPCS.1994.367023","url":null,"abstract":"We propose a novel method of scheduling memory access on a non blocking interconnection network that provides only one-to-one communication. Conflicts at the switches can be avoided if the accesses are scheduled so that no two processors attempt to access the same memory at the same time. We show how such a scheduling problem can be mapped to an edge coloring problem for a directed graph and present algorithms for solving that problem. We give examples of the application of the algorithm and present simulation results.<<ETX>>","PeriodicalId":64175,"journal":{"name":"专用汽车","volume":"216 1","pages":"643-654"},"PeriodicalIF":0.0,"publicationDate":"1994-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75606070","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
首页 上一页 下一页 尾页
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学术官方微信