標題: Titlebook: CONPAR 81; Conference on Analys W. Brauer,P. Brinch Hansen,Wolfgang H?ndler Conference proceedings 1981 Springer-Verlag Berlin Heidelberg 1 [打印本頁] 作者: detumescence 時間: 2025-3-21 18:30
書目名稱CONPAR 81影響因子(影響力)
書目名稱CONPAR 81影響因子(影響力)學科排名
書目名稱CONPAR 81網絡公開度
書目名稱CONPAR 81網絡公開度學科排名
書目名稱CONPAR 81被引頻次
書目名稱CONPAR 81被引頻次學科排名
書目名稱CONPAR 81年度引用
書目名稱CONPAR 81年度引用學科排名
書目名稱CONPAR 81讀者反饋
書目名稱CONPAR 81讀者反饋學科排名
作者: ALERT 時間: 2025-3-21 22:26
0302-9743 Overview: 978-3-540-10827-6978-3-540-38715-2Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: orthopedist 時間: 2025-3-22 03:43 作者: Resection 時間: 2025-3-22 06:13
Two Voronoi-based techniques for FINDPATH,is presented in which various array and multiple-scalar machines are all special cases. The methods are implemented in the Parafrase system, which can be used for machine design as well as compiler design studies.作者: 松軟 時間: 2025-3-22 11:25
https://doi.org/10.1007/3-540-17629-2. A particular form of this statement is then presented which permits to take full advantage of possibilities for parallel computation inherent in applications such as vector processing. Some parallel programming language features are developed and examples are presented.作者: 結構 時間: 2025-3-22 14:15 作者: 結構 時間: 2025-3-22 19:24
https://doi.org/10.1007/3-540-27761-7.For infinite problems programs can be executed repeatedly without correctness problems. For the choice of refinement formal guidelines can be used..The derived solutions have the following properties:作者: adduction 時間: 2025-3-22 22:22 作者: Bombast 時間: 2025-3-23 01:42
978-3-540-10827-6Springer-Verlag Berlin Heidelberg 1981作者: 送秋波 時間: 2025-3-23 09:21
Operating systems support for the finite element machine,ite element methods. In this paper, interaction of the hardware aspects of the machine with a specific algorithm is examined in order to establish software primitives for the kernel of an operating system. The behavior of the primitives is explored in detail, and the effects of this behavior on the performance of the algorithm is evaluated.作者: 憤怒事實 時間: 2025-3-23 12:30 作者: 多余 時間: 2025-3-23 17:25 作者: indigenous 時間: 2025-3-23 20:24 作者: 孤獨無助 時間: 2025-3-24 00:40 作者: 很像弓] 時間: 2025-3-24 03:52
https://doi.org/10.1007/3-540-17629-2. Two processors may communicate only via a common communication link. Such a tree machine is a completely general, concurrent processing engine and can be used for problems decomposed in a hierarchical way. Implementation of divide-and-conquer algorithms on a tree machine is discussed. Algorithms f作者: 新奇 時間: 2025-3-24 08:29
https://doi.org/10.1007/3-540-17629-2tage of such a representation, called Q-notation, is that multiple processors can be used in a very regular manner, so that a simple and natural mapping of parallel computations onto parallel processors is achieved. The proposed machines are characterized by very efficient and fast instruction issue作者: 變形 時間: 2025-3-24 14:10
Two Voronoi-based techniques for FINDPATH,ite element methods. In this paper, interaction of the hardware aspects of the machine with a specific algorithm is examined in order to establish software primitives for the kernel of an operating system. The behavior of the primitives is explored in detail, and the effects of this behavior on the 作者: microscopic 時間: 2025-3-24 18:17 作者: LAVA 時間: 2025-3-24 22:07 作者: 震驚 時間: 2025-3-25 03:06 作者: Adrenal-Glands 時間: 2025-3-25 06:06 作者: 闡釋 時間: 2025-3-25 09:35 作者: 向宇宙 時間: 2025-3-25 13:38 作者: Foolproof 時間: 2025-3-25 19:18
Urban Forest Resources in European Citieswever, it is unreasonable to expect users to exploit this parallelism at such a low level, and it is necessary to provide high level programming facilities which allow the user the abstract freedom of expression he requires, whilst permitting efficient use of the hardware. It has been noticed that s作者: 亂砍 時間: 2025-3-25 23:22 作者: 痛打 時間: 2025-3-26 00:48 作者: 慟哭 時間: 2025-3-26 05:07 作者: follicle 時間: 2025-3-26 09:15 作者: 全國性 時間: 2025-3-26 12:42
https://doi.org/10.1007/3-540-27761-7 measure the parallelism in these programs. Graph analysis is made on modified data dependency graphs. Several kinds of parallelism are considered, and particularly pipelining..A control scheme for a parallel computer, taking into account all the parallelism exhibited by the graph analysis and even 作者: Acupressure 時間: 2025-3-26 18:53 作者: 大火 時間: 2025-3-26 21:55 作者: 感染 時間: 2025-3-27 01:43
https://doi.org/10.1007/3-540-27761-7ates the specification of both invariant and time-dependent properties. The paper begins with a discussion of properties that affect synchronization. The specification language then introduced features constructs to express each of these in a fairly natural and modular fashion. Since the statements 作者: Flavouring 時間: 2025-3-27 08:33 作者: 公豬 時間: 2025-3-27 11:47 作者: 乏味 時間: 2025-3-27 16:16
Zbigniew Michalewicz,Lindsay J. Groveser is intended to accept the full language without changing its semantics in any respect. The implementation of a sizable subset of the language is described and solutions to the remaining problems are suggested. The results indicate that the gap between data flow machines and conventional languages is easier to bridge than previously assumed.作者: frugal 時間: 2025-3-27 17:50
The Artificial Urinary Sphincternchronized or protected access to shared memory, as well as message-oriented approaches, where processes communicate via message channels, are considered. The duality of these two concepts is outlined. Moreover these constructs are compared to applicative constructs for concurrent programming such as data flow languages.作者: 存在主義 時間: 2025-3-27 22:05 作者: 功多汁水 時間: 2025-3-28 04:03
https://doi.org/10.1007/3-540-27761-7d particularly pipelining..A control scheme for a parallel computer, taking into account all the parallelism exhibited by the graph analysis and even dynamic pipelining, is then proposed. The control scheme is based on single assigment and guarded commands, associated with a data-driven mechanism.作者: connoisseur 時間: 2025-3-28 06:58 作者: Irascible 時間: 2025-3-28 14:22 作者: 違抗 時間: 2025-3-28 16:13
Queue machines: An organization for parallel computation,, modularity with useful fault-tolerance properties, and simplified interconnection requirements. We define a Q-notation for program representation and discuss in general its capabilities and limitations in executing ordinary (sequential) and concurrent programs.作者: Hiatus 時間: 2025-3-28 18:45 作者: 數(shù)量 時間: 2025-3-29 01:44
Cellular algorithms for binary matrix operations,y matrixes, taking into account the cellprocessor architecture developed by T. Legendi. Moreover, on the basis of this solution cellular algorithms are given for coding and for the computation of the m-th power of a binary matrix.作者: Lipoprotein(A) 時間: 2025-3-29 06:10 作者: ingenue 時間: 2025-3-29 08:13 作者: interrupt 時間: 2025-3-29 13:53
Language design approaches for parallel processors, considered which reflects neither the compiler’s detection mechanism nor the underlying hardware but enables the programmer to express the inherent parallelism of a solution to a problem. In this way a joint syntax can be developed for both types of parallel processors.作者: 樂意 時間: 2025-3-29 16:57 作者: 姑姑在炫耀 時間: 2025-3-29 23:12
On language constructs for concurrent programs,nchronized or protected access to shared memory, as well as message-oriented approaches, where processes communicate via message channels, are considered. The duality of these two concepts is outlined. Moreover these constructs are compared to applicative constructs for concurrent programming such as data flow languages.作者: 同義聯(lián)想法 時間: 2025-3-30 02:18
Analysis of concurrent algorithms,sses must be considered. This is done by using the communication sequences of the processes as the basis of the analysis. The technique is used for analyzing and comparing three concurrent algorithms for finding the root of a real function.作者: 加入 時間: 2025-3-30 04:20 作者: 急急忙忙 時間: 2025-3-30 09:21
On synchronization and its specification,The specification language then introduced features constructs to express each of these in a fairly natural and modular fashion. Since the statements in the language have intuitive interpretations, specifications are humanly readable. Also, since they possess appropriate formal semantics, unambiguous specifications result.作者: FRONT 時間: 2025-3-30 13:43 作者: 拱形面包 時間: 2025-3-30 16:33
https://doi.org/10.1007/3-540-17629-2, modularity with useful fault-tolerance properties, and simplified interconnection requirements. We define a Q-notation for program representation and discuss in general its capabilities and limitations in executing ordinary (sequential) and concurrent programs.作者: 使饑餓 時間: 2025-3-30 21:17
https://doi.org/10.1007/3-540-27761-7ardized cellular techniques. Here we present a systematic method, how additional information can be added to the words to be recognized in order to facilitate the application of these techniques. The with-additional-information recognizing process can be converted algorithmically into a without-additional-information recognizing one.作者: malign 時間: 2025-3-31 02:51 作者: 殘酷的地方 時間: 2025-3-31 08:28
Urban Forest Resources in European Citiesomputer. The syntax of Lapse, which resembles Pascal, is introduced, and code generation templates are presented. Some possible optimisations of flowgraph code are discussed, particularly in the implementation of arrays.作者: HEDGE 時間: 2025-3-31 10:42
Generation of dataflow graphical object code for the lapse programming language,omputer. The syntax of Lapse, which resembles Pascal, is introduced, and code generation templates are presented. Some possible optimisations of flowgraph code are discussed, particularly in the implementation of arrays.作者: extrovert 時間: 2025-3-31 14:11
Language support for designing multilevel computer systems,d on it: verification, simulation, testing, etc..In the following we shall give an introduction and the motivations, after that an informal description will be given. The formal syntax of AL is in Appendix 1, and Appendix 2 contains an example.作者: 移動 時間: 2025-3-31 20:47 作者: 接合 時間: 2025-3-31 21:40
Programming and structure changes in parallel computers,作者: 松雞 時間: 2025-4-1 02:13
Tree machines and divide-and-conquer algorithms,. Two processors may communicate only via a common communication link. Such a tree machine is a completely general, concurrent processing engine and can be used for problems decomposed in a hierarchical way. Implementation of divide-and-conquer algorithms on a tree machine is discussed. Algorithms f作者: 議程 時間: 2025-4-1 07:04 作者: visceral-fat 時間: 2025-4-1 12:17 作者: 輕打 時間: 2025-4-1 15:28 作者: 磨碎 時間: 2025-4-1 20:03 作者: 不可接觸 時間: 2025-4-1 22:56 作者: myopia 時間: 2025-4-2 05:17 作者: 外來 時間: 2025-4-2 10:04
