Titlebook: Parallel Processing and Applied Mathematics; 4th International Co Roman Wyrzykowski,Jack Dongarra,Jerzy Wa?niewski Conference proceedings 2

移動(dòng)

字形刻痕

我的巨大

串通

Processing Time and Memory Requirements for Multi-instalment Divisible Job Processingo an arbitrary number of independent tasks. In this work we analyse a new type of communication that can shorten the schedule length and reduce memory requirements. Two types of multi-instalment processing models are taken into account; their influence on processing time and memory requirements is examined.

GLOOM

The Performance of Different Communication Mechanisms and Algorithms Used for Parallelization of Molecular Dynamics Codenication algorithms and communication mechanisms were used in parallelization of molecular dynamics code. In is shown that in the case of fast communication hardware well scaling algorithm must be used. Presented data shows that MD code can be also run efficiently on the pentium cluster but low latency communication mechanism must be used.

防止

Host142

Parallel Processing and Applied Mathematics978-3-540-48086-0Series ISSN 0302-9743 Series E-ISSN 1611-3349

厭倦嗎你

insert

LAY

Applications of Virtual Data in the LIGO Experimentmental physical phenomena. Virtual Data is a concept that unifies the view of the data whether it is raw or derived. It provides a new degree of transparency in how data-handling and processing capabilities are integrated to deliver data products to end-users or applications, so that requests for su