作者: TAIN 時間: 2025-3-21 23:16 作者: 背帶 時間: 2025-3-22 02:46 作者: 朋黨派系 時間: 2025-3-22 06:19
The parallel computation of partial eigensolutions of large matrices on a massively parallel procesetermination of the solution of many of the important problems encountered in scientific and engineering applications. A common characteristic of two distinct classes of iterative methods for the computation of such eigenvalues and eigenvectors is the construction of a sequence of subspaces which co作者: BET 時間: 2025-3-22 11:45
,Implementing the parallel quasi-Laguerre’s algorithm for symmetric tridiagonal eigenproblems, The algorithm is implemented using PVM and tested on a variety of matrices with a load balancing scheme. Test results show that the algorithm has high parallel efficiency. Compared with other existing algorithms, our algorithm seems to be the best for distributed memory parallel architecture.作者: 輕彈 時間: 2025-3-22 13:49
Comparing task and data parallel execution schemes for the DIIRK method,ution of stiff systems of ordinary differential equations. We discuss different strategies for the implementation of the method on distributed memory multiprocessors, which mainly differ in the data distribution and the order of independent computations. In particular, we consider a . that executes 作者: 輕彈 時間: 2025-3-22 17:53
Numerical turbulence simulation on different parallel computers using the sparse grid combination mon the independent solution of many problems with reduced size and their linear combination. The algorithm for 3-dimensional problems is described. Its parallel implementation on an IBM SP2 and a cluster of 16 HP workstations is discussed.作者: 不再流行 時間: 2025-3-22 21:42 作者: 無底 時間: 2025-3-23 03:47 作者: 獸皮 時間: 2025-3-23 09:04
Parallel solution of the volume integral equation of electromagnetic scattering,ive methods can be parallelized. The performance of the serial code is discussed on a vector system and on a RISC processor. The performance depends very much on the memory architecture. The parallel version of the code is written using MPI. We obtain good parallel speedup when the elements of the c作者: Sputum 時間: 2025-3-23 13:43 作者: 執(zhí) 時間: 2025-3-23 16:17
A time and space parallel algorithm for the heat equation: The implicit collocation method,ution of the heat equation is approximated by polynomials, the coefficients of which are computed from a block-tridiagonal linear system. Once the polynomials have been determined for a given time interval, the solution can be computed in parallel at any point of this interval. If the number of poin作者: ablate 時間: 2025-3-23 18:52 作者: PATHY 時間: 2025-3-24 00:02
An asynchronous parallel algorithm for symbolic grouping operations in vision,ong the processors, unbalanced workload, and irregular inter-processor data dependencies caused by the input image. In this paper, we propose an asynchronous algorithm for solving symbolic grouping problems on distributed memory machines. The algorithm balances the workload and overlaps communicatio作者: 階層 時間: 2025-3-24 05:10 作者: Calibrate 時間: 2025-3-24 10:13
High-performance SAR image formation and post-processing,ing more and more strategic for remote sensing applications, still requiring the use of data-parallel processing. Fast formation of images from radar data requires dedicated machines suited to fine-grained, DSP-based parallelism, while improving the image quality through despeckling is suited to lar作者: 打算 時間: 2025-3-24 10:55
A parallel implementation of image coding using linear prediction and iterated function systems,iterated function systems, which are employed instead of the usual quantizers to encode the predictive residuals. This technique has been implemented on the Meiko CS 1 and is easily extended to all distributed-memory MIMD architectures. Experimental tests have shown that . can achieve very low bit-r作者: Spangle 時間: 2025-3-24 15:30 作者: 滲透 時間: 2025-3-24 22:09 作者: HEAVY 時間: 2025-3-24 23:58
https://doi.org/10.1007/978-3-662-42526-8 linear systems. With detailed estimations of computation and communication cost we quantitatively analyze their influence on the parallel performance of the algorithm. We report on numerical experiments executed on an Intel Paragon XP/S-22MP.作者: construct 時間: 2025-3-25 04:17 作者: pineal-gland 時間: 2025-3-25 08:48 作者: OREX 時間: 2025-3-25 15:09 作者: enmesh 時間: 2025-3-25 18:02 作者: left-ventricle 時間: 2025-3-25 22:32
,Implementing the parallel quasi-Laguerre’s algorithm for symmetric tridiagonal eigenproblems, The algorithm is implemented using PVM and tested on a variety of matrices with a load balancing scheme. Test results show that the algorithm has high parallel efficiency. Compared with other existing algorithms, our algorithm seems to be the best for distributed memory parallel architecture.作者: EWER 時間: 2025-3-26 03:42 作者: 配置 時間: 2025-3-26 04:59
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/e/image/316554.jpg作者: Employee 時間: 2025-3-26 11:17
978-3-540-61627-6Springer-Verlag Berlin Heidelberg 1996作者: 前兆 時間: 2025-3-26 16:14 作者: 偽證 時間: 2025-3-26 17:08 作者: 描述 時間: 2025-3-27 00:10 作者: 異端邪說下 時間: 2025-3-27 05:00 作者: prostatitis 時間: 2025-3-27 08:18
Die Grundgleichungen der Mechaniketermination of the solution of many of the important problems encountered in scientific and engineering applications. A common characteristic of two distinct classes of iterative methods for the computation of such eigenvalues and eigenvectors is the construction of a sequence of subspaces which co作者: 同時發(fā)生 時間: 2025-3-27 09:30
Ungrund und Schweben: Erster Grundsatz, The algorithm is implemented using PVM and tested on a variety of matrices with a load balancing scheme. Test results show that the algorithm has high parallel efficiency. Compared with other existing algorithms, our algorithm seems to be the best for distributed memory parallel architecture.作者: Compass 時間: 2025-3-27 13:49
E. Skudr?yk B. Sc. (Eng.) A. C. G. I.ution of stiff systems of ordinary differential equations. We discuss different strategies for the implementation of the method on distributed memory multiprocessors, which mainly differ in the data distribution and the order of independent computations. In particular, we consider a . that executes 作者: 鐵砧 時間: 2025-3-27 19:24
https://doi.org/10.1007/978-3-663-04630-1on the independent solution of many problems with reduced size and their linear combination. The algorithm for 3-dimensional problems is described. Its parallel implementation on an IBM SP2 and a cluster of 16 HP workstations is discussed.作者: 要控制 時間: 2025-3-27 23:43 作者: MUTED 時間: 2025-3-28 03:12
Begriff und Aufgaben der Hochfrequenztechnikd without absorption with almost optimal transition frequency function..Recently Alexandrov, Megson and Dimov has shown that an .×. matrix can be inverted in 3./2 + . steps on regular arrays with .(...) cells. A number of bounds on . and . have been established (. is the number of chains and . is th作者: 我悲傷 時間: 2025-3-28 08:40
Saul Dushman,R. G. Berthold,E. Reimannive methods can be parallelized. The performance of the serial code is discussed on a vector system and on a RISC processor. The performance depends very much on the memory architecture. The parallel version of the code is written using MPI. We obtain good parallel speedup when the elements of the c作者: 自負(fù)的人 時間: 2025-3-28 12:32 作者: 阻塞 時間: 2025-3-28 16:13
Duale Nomogramme, Kurvenscharen,ution of the heat equation is approximated by polynomials, the coefficients of which are computed from a block-tridiagonal linear system. Once the polynomials have been determined for a given time interval, the solution can be computed in parallel at any point of this interval. If the number of poin作者: BAIT 時間: 2025-3-28 19:10 作者: 蓋他為秘密 時間: 2025-3-29 02:27
,Drei Tatsachen — drei Widersprüche,ong the processors, unbalanced workload, and irregular inter-processor data dependencies caused by the input image. In this paper, we propose an asynchronous algorithm for solving symbolic grouping problems on distributed memory machines. The algorithm balances the workload and overlaps communicatio作者: 揮舞 時間: 2025-3-29 06:23
https://doi.org/10.1007/978-3-642-94816-9obtain better execution times we propose a new procedure to parallelize the detection process in a distributed memory multiprocessor. The sequential algorithm splits the detection of parameters into several stages and uses a focusing algorithm to implement the most complex ones. In this work, each s作者: larder 時間: 2025-3-29 08:12
,Der Tragflügel in drei Dimensionen,ing more and more strategic for remote sensing applications, still requiring the use of data-parallel processing. Fast formation of images from radar data requires dedicated machines suited to fine-grained, DSP-based parallelism, while improving the image quality through despeckling is suited to lar作者: 哀求 時間: 2025-3-29 12:30 作者: 結(jié)束 時間: 2025-3-29 17:53
,Molekülspektren und chemische Bindung,This workshop covers a wide range of issues in software and hardware design, structured under three headings: parallel image processing, computer arithmetic and design automation for multimedia processors.作者: 單挑 時間: 2025-3-29 22:56
Parallel image/video processing and computer arithmetic,This workshop covers a wide range of issues in software and hardware design, structured under three headings: parallel image processing, computer arithmetic and design automation for multimedia processors.作者: ingestion 時間: 2025-3-30 03:02 作者: Fester 時間: 2025-3-30 04:20
The parallel computation of partial eigensolutions of large matrices on a massively parallel procesf the algorithms are proposed and implemented on an MPP Connection Machine CM-200 with 8K processors. A comparative evaluation of the efficiency of the most efficient version of each of the two algorithms for a variety of different types of matrices of maximum order 11,948 is also presented.作者: HAIRY 時間: 2025-3-30 10:00
Comparing task and data parallel execution schemes for the DIIRK method,the steps of each corrector iteration in sequential order and distributes the resulting equation systems among all available processors, and a . that executes the steps in parallel by independent groups of processors.作者: hangdog 時間: 2025-3-30 13:36
Optimization of parallel multilevel-Newton algorithms on workstation clusters,f these algorithms depends essentially on an optimal partitioning and adaption to actually achieved transmission performance of the network. Recent results with the circuit simulator TITAN at Siemens‘ research laboratories are discussed.作者: Flawless 時間: 2025-3-30 17:39
A time and space parallel algorithm for the heat equation: The implicit collocation method,ts where the solution is computed in the considered time interval is sufficient, it appears that the performances of the implicit collocation method on a parallel machine are better than those of finite difference methods. Numerical experiments on a SIMD architecture are reported.作者: 無力更進(jìn) 時間: 2025-3-31 00:34
A parallel implementation of image coding using linear prediction and iterated function systems,ates with satisfactory subjective and objective quality. For high compression ratios, . can be considered an effective alternative to standard techniques such as .. The high intrinsic parallelism of the proposed scheme yields speedups close to the number of processors.作者: Urologist 時間: 2025-3-31 01:39
0302-9743 ed papers were selected from a total of 383 submissions by authors from 40 countries; 554 referees were involved in the selection process and the index lists 521 contributing authors.978-3-540-61627-6978-3-540-70636-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: GLOSS 時間: 2025-3-31 08:15
,Der Tragflügel in drei Dimensionen,me SAR processing on a custom, DSP-based parallel system, called ACIP-XSAR; and the results of the Esprit PULSAR project, providing a portable and scalable parallel package for image despeckling and segmentation.作者: 委派 時間: 2025-3-31 10:05
High-performance SAR image formation and post-processing,me SAR processing on a custom, DSP-based parallel system, called ACIP-XSAR; and the results of the Esprit PULSAR project, providing a portable and scalable parallel package for image despeckling and segmentation.作者: 簡潔 時間: 2025-3-31 14:37 作者: sultry 時間: 2025-3-31 21:08 作者: 性別 時間: 2025-4-1 01:11
Comparison of three Monte Carlo methods for Matrix Inversion,nment, i.e. running on a cluster of workstations under PVM. The Monte Carlo method with almost optimal frequency function performs best of the three methods as it needs about six-ten times less chains for the same precision.作者: Obliterate 時間: 2025-4-1 05:09
An asynchronous parallel algorithm for symbolic grouping operations in vision,e, the line grouping operation can be performed in 0.294 seconds on a T3D having 64 processors. A serial implementation takes 5.696 seconds on a single processor of T3D. The implementation was performed using MPI and C and is portable.作者: COMA 時間: 2025-4-1 06:17 作者: OPINE 時間: 2025-4-1 13:26
