標(biāo)題: Titlebook: CONPAR 86; Conference on Algori Wolfgang H?ndler,Dieter Haupt,Otto Lange Conference proceedings 1986 Springer-Verlag Berlin Heidelberg 1986 [打印本頁] 作者: bile-acids 時(shí)間: 2025-3-21 18:21
書目名稱CONPAR 86影響因子(影響力)
書目名稱CONPAR 86影響因子(影響力)學(xué)科排名
書目名稱CONPAR 86網(wǎng)絡(luò)公開度
書目名稱CONPAR 86網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱CONPAR 86被引頻次
書目名稱CONPAR 86被引頻次學(xué)科排名
書目名稱CONPAR 86年度引用
書目名稱CONPAR 86年度引用學(xué)科排名
書目名稱CONPAR 86讀者反饋
書目名稱CONPAR 86讀者反饋學(xué)科排名
作者: OPINE 時(shí)間: 2025-3-21 21:07
CONPAR 86978-3-540-44856-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 鳥籠 時(shí)間: 2025-3-22 01:46
0302-9743 Overview: 978-3-540-16811-9978-3-540-44856-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Lacunar-Stroke 時(shí)間: 2025-3-22 08:07 作者: OGLE 時(shí)間: 2025-3-22 09:49
Zwischengitteratome in Metallen,sages with its two ring neighbors..A branch-and-bound procedure is implemented in Pascal to run in parallel on the ring and solve the Travelling-Salesman-Problem. Heuristics are developed to maintain a priority queue in a distributed heap. The computing times and speedups for 25 random graphs obtained with up to 16 ring members are discussed.作者: DEFT 時(shí)間: 2025-3-22 13:02
https://doi.org/10.1007/978-3-322-85912-9llelism to Gaussian elimination that has been frequently exploited. We can take advantage of this parallelism in addition to that provided by the sparsity itself. We discuss this latter parallelism in some detail..We discuss an approach that exploits the parallelism due to the sparsity and that can 作者: DEFT 時(shí)間: 2025-3-22 17:26
https://doi.org/10.1007/978-3-322-85589-3er of interesting parallel computer products are appearing. The design motivations cover a broad spectrum: (i) parallel UNIX systems (e.g. SEQUENT Balance), (ii) Artificial Intelligence applications (e.g. Connection Machine), (iii) high performance numerical Supercomputers (e.g. Cosmic Cube), (iv) e作者: Fulminate 時(shí)間: 2025-3-23 00:01 作者: 我沒有強(qiáng)迫 時(shí)間: 2025-3-23 04:23
Molekulargenetische medizinische Diagnostik,d E.M.P. is an incentive for replacing electronics by optics. Another incentive is the speed potential based on a carrier frequency of a million GHz..Yet another incentive is the superior communications topology of optics: many light rays can criss-cross each other without disturbances. For comparis作者: TSH582 時(shí)間: 2025-3-23 06:01
Biosynthese biologisch aktiver Naturstoffe,cessing and computational geometry. In this paper, we consider certain practical issues in such arrays which include fewer processors connected to the broadcast buses and finite time, namely log . time for broadcasting data to . processors. We propose a modified broadcast bus VLSI architecture which作者: 有節(jié)制 時(shí)間: 2025-3-23 11:23
https://doi.org/10.1007/978-3-322-86179-5r operations at maximum efficiency. In addition, it can also handle communicating vector operations, and hence exploit irregular parallelism present in many apparently sequential algorithms. The system is therefore suitable for a wide range of algorithms with varying degrees of parallelism. In this 作者: 使厭惡 時(shí)間: 2025-3-23 16:25
https://doi.org/10.1007/978-3-322-86465-9 transport in non-shared memory systems by the example of a multigrid method. To this purpose, this method was implemented on the processor kit DIRMU-25 for measuring the required computing time. On the other hand, we have developed a simple abstract process model describing the computational work b作者: CARK 時(shí)間: 2025-3-23 18:16 作者: arrhythmic 時(shí)間: 2025-3-24 00:55
https://doi.org/10.1007/978-3-322-85323-3tational complexity of the GFT are investigated on the basis of a theoretical group approach and a matrix pseudoinversion. The approach considered reveals common and sometimes unexpected features of these transforms, the parallel realization of the algorithms becoming thus possible.作者: 震驚 時(shí)間: 2025-3-24 03:03 作者: myocardium 時(shí)間: 2025-3-24 06:51 作者: 百靈鳥 時(shí)間: 2025-3-24 12:53 作者: 駭人 時(shí)間: 2025-3-24 18:28 作者: membrane 時(shí)間: 2025-3-24 20:31 作者: 混合物 時(shí)間: 2025-3-25 01:02
Full recursive form of the algorithms for fast generalized fourier transforms,tational complexity of the GFT are investigated on the basis of a theoretical group approach and a matrix pseudoinversion. The approach considered reveals common and sometimes unexpected features of these transforms, the parallel realization of the algorithms becoming thus possible.作者: Facilities 時(shí)間: 2025-3-25 06:20
Implementing branch-and-bound in a ring of processors,sages with its two ring neighbors..A branch-and-bound procedure is implemented in Pascal to run in parallel on the ring and solve the Travelling-Salesman-Problem. Heuristics are developed to maintain a priority queue in a distributed heap. The computing times and speedups for 25 random graphs obtained with up to 16 ring members are discussed.作者: Inflammation 時(shí)間: 2025-3-25 10:56 作者: 狗舍 時(shí)間: 2025-3-25 13:45
978-3-540-16811-9Springer-Verlag Berlin Heidelberg 1986作者: Compass 時(shí)間: 2025-3-25 19:01 作者: 使腐爛 時(shí)間: 2025-3-25 23:24
Caltech hypercube MIMD computer performances measurements in a physical mathematical application,A Caltech Hypercube has been characterized using known methods to obtain performance figures from a MIMD computer. Speed-up, efficiency and communication cost have been evaluated versus the number of used processors and the physical problem dimensions.作者: FER 時(shí)間: 2025-3-26 00:57
Die Sicherheit von nuklearen Systemen,e analyzed at the beginning of computation. Then the size of each cluster and the connections between clusters are adapted to the problem automatically. Using this mechanism, effective computation is possible in various types of problems.作者: 小鹿 時(shí)間: 2025-3-26 08:19
https://doi.org/10.1007/978-3-322-86465-9sor computers with two and four vector processors. The algorithms are intended to use all processors in parallel as far as possible under the condition that the vector efficiency in the parallel tasks does not substantially decrease. We report numerical results for programs using the multitasking routines on 1 and 2-processor CRAY-X/MP.作者: endocardium 時(shí)間: 2025-3-26 12:27 作者: Ischemia 時(shí)間: 2025-3-26 12:47
An adaptable cluster structure of (,), -II,e analyzed at the beginning of computation. Then the size of each cluster and the connections between clusters are adapted to the problem automatically. Using this mechanism, effective computation is possible in various types of problems.作者: 夾克怕包裹 時(shí)間: 2025-3-26 17:46 作者: Felicitous 時(shí)間: 2025-3-27 00:04 作者: CLAM 時(shí)間: 2025-3-27 01:36
https://doi.org/10.1007/978-3-322-85912-9automatically benefit also from the parallelism of Gaussian elimination. This approach, which is applicable to quite general systems, is based on a multifrontal technique..We look at the implementation of the multifrontal approach on shared memory machines and discuss its implementation on a hypercube.作者: 虛弱的神經(jīng) 時(shí)間: 2025-3-27 09:22
https://doi.org/10.1007/978-3-322-85589-3xploitation of Very Large Scale Integration (e.g. INMOS Transputer), and (v) new technologies (e.g. Optical computers). This short paper gives an overview of these novel parallel computers and discusses their likely commercial impact.作者: 顧客 時(shí)間: 2025-3-27 11:12 作者: 寬敞 時(shí)間: 2025-3-27 16:25 作者: 谷物 時(shí)間: 2025-3-27 18:31 作者: Hemiparesis 時(shí)間: 2025-3-27 23:43 作者: adduction 時(shí)間: 2025-3-28 04:45 作者: corpuscle 時(shí)間: 2025-3-28 09:54
The parallel solution of sparse linear equations,automatically benefit also from the parallelism of Gaussian elimination. This approach, which is applicable to quite general systems, is based on a multifrontal technique..We look at the implementation of the multifrontal approach on shared memory machines and discuss its implementation on a hypercube.作者: lattice 時(shí)間: 2025-3-28 14:03 作者: 罵人有污點(diǎn) 時(shí)間: 2025-3-28 16:21 作者: Recess 時(shí)間: 2025-3-28 20:12 作者: 協(xié)議 時(shí)間: 2025-3-29 01:34 作者: Communicate 時(shí)間: 2025-3-29 06:48
Molekulargenetische medizinische Diagnostik,Yet another incentive is the superior communications topology of optics: many light rays can criss-cross each other without disturbances. For comparison: only one wire can occupy any particular part of the three-dimensional space..The specific projects at Erlangen deal with optics in conventional computers as well as with all optical computers.作者: PURG 時(shí)間: 2025-3-29 10:45 作者: dry-eye 時(shí)間: 2025-3-29 14:04 作者: Mercantile 時(shí)間: 2025-3-29 19:15
SISAL: Initial MIMD performance results,s. We outline the run time management software. Speedup data from a few representative benchmarks demonstrates that SISAL uses the available concurrency of the Denelcor HEP multiprocessor well via completely automatic detection and implementation of parallelism.作者: 笨拙處理 時(shí)間: 2025-3-29 23:13
Biosynthese biologisch aktiver Naturstoffe, this architecture, maximum, minimum, or sum of . values can be found in .(.), median row of a binary picture in .(.), shortest distance between two points in .(.). This architecture is well suited for parallel processing of applications in Linear Algebra, Image Processing, Computational Geometry an作者: 搖曳的微光 時(shí)間: 2025-3-30 01:22 作者: 藥物 時(shí)間: 2025-3-30 05:09
A radically non-von-Neumann-architecture for learning and discovery,作者: Innovative 時(shí)間: 2025-3-30 08:42
,SUPRENUM — an MIMD multiprocessor system for multi-level scientific computing,作者: 休息 時(shí)間: 2025-3-30 15:18 作者: anus928 時(shí)間: 2025-3-30 17:17 作者: 憎惡 時(shí)間: 2025-3-30 22:10
Future parallel computers,er of interesting parallel computer products are appearing. The design motivations cover a broad spectrum: (i) parallel UNIX systems (e.g. SEQUENT Balance), (ii) Artificial Intelligence applications (e.g. Connection Machine), (iii) high performance numerical Supercomputers (e.g. Cosmic Cube), (iv) e作者: 側(cè)面左右 時(shí)間: 2025-3-31 02:47
An adaptable cluster structure of (,), -II, treat these problems effectively, we have developed a dedicated parallel machine called (.).-II (’the Sparse Matrix Solving Machine’ version II)..(.).-II is composed of multiple clusters, each consisting of multiple PUs (Processing Units) connected by a special communication mechanism called RSM (R作者: Optometrist 時(shí)間: 2025-3-31 05:10
The digital optical computing program at Erlangen,d E.M.P. is an incentive for replacing electronics by optics. Another incentive is the speed potential based on a carrier frequency of a million GHz..Yet another incentive is the superior communications topology of optics: many light rays can criss-cross each other without disturbances. For comparis作者: 形容詞 時(shí)間: 2025-3-31 12:41
Hmesh: A vlsi architecture for parallel processing,cessing and computational geometry. In this paper, we consider certain practical issues in such arrays which include fewer processors connected to the broadcast buses and finite time, namely log . time for broadcasting data to . processors. We propose a modified broadcast bus VLSI architecture which作者: conspicuous 時(shí)間: 2025-3-31 15:16 作者: 侵略主義 時(shí)間: 2025-3-31 18:57
Analysis of multigrid methods for non-shared memory systems by a simple performance model, transport in non-shared memory systems by the example of a multigrid method. To this purpose, this method was implemented on the processor kit DIRMU-25 for measuring the required computing time. On the other hand, we have developed a simple abstract process model describing the computational work b作者: convert 時(shí)間: 2025-3-31 22:07
Multitasking algorithms on CRAY computers for interval arithmetic Newton-like methods for a class ondition that an initial inclusion is known, i.e. the convergence can be said to be global. We consider vector algorithms for an interval arithmetic Newton-like method which is combined with an interval arithmetic “fast solver” for nonlinear systems with block tridiagonal Jacobian. As an example we c作者: CHIP 時(shí)間: 2025-4-1 04:32 作者: Innocence 時(shí)間: 2025-4-1 07:31 作者: Ankylo- 時(shí)間: 2025-4-1 12:23
