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

Taft

書目名稱Parallel Processing and Applied Mathematics影響因子(影響力)




書目名稱Parallel Processing and Applied Mathematics影響因子(影響力)學科排名




書目名稱Parallel Processing and Applied Mathematics網(wǎng)絡公開度




書目名稱Parallel Processing and Applied Mathematics網(wǎng)絡公開度學科排名




書目名稱Parallel Processing and Applied Mathematics被引頻次




書目名稱Parallel Processing and Applied Mathematics被引頻次學科排名




書目名稱Parallel Processing and Applied Mathematics年度引用




書目名稱Parallel Processing and Applied Mathematics年度引用學科排名




書目名稱Parallel Processing and Applied Mathematics讀者反饋




書目名稱Parallel Processing and Applied Mathematics讀者反饋學科排名

Diuretic

Marcin Kuta,Darin Nikolow,Renata S?ota,Jacek Kitowskiss der Abschluss einer Versicherung die Abw?lzung eines nicht gewollten Risikos bedeutet, der Abschluss einer Wette hingegen die bewusste übernahme eines Risikos. Eine Versicherung wirkt demzufolge risikomindernd, eine Wette risikoerh?hend.

Decrepit

Checkpointing Speculative Distributed Shared Memoryerformance improvement. The proposed mechanism is based on independent checkpointing integrated with a coherence protocol for a given consistency model introducing little overhead. It ensures the consistency of checkpoints, allowing fast recovery from failures.

fabricate

連接

MAPLE

歡呼

Taking Advantage of the SHECS-Based Critical Sections in the Shared Memory Parallel Architecturesof system architecture equipped with SHECS, the algorithm to implement operating system or application level locking service, and the results obtained with the method simulation on the network processor Intel IXP2800.

BRINK

Maximal Group Membership in Ad Hoc Networksproperties of such groups and a maximality criterion based on cliques, we propose a group membership algorithm. Lastly, with respect to this criterion, we compare our algorithm with two group membership algorithms for ad hoc environments. Moreover, a formal description in TLA+ has been programmed and verified by model-checking for small networks.

縮影

A Self-stabilizing Algorithm for Finding a?Spanning Tree in a Polynomial Number of Movesizing algorithm working in a polynomial number of moves, without any fairness assumptions. Additionally we show that this approach can be applied under a distributed daemon. We briefly discuss implementation aspects of the proposed algorithm and its application in broadcast routing and in distributed computing.

GROSS

The Distributed Stigmergic Algorithm for Multi-parameter Optimizationtion problem has already been shown in literature. However, even if this method offers good quality of solution, it still needs considerable computational time. With distributed implementation of the MASA the computation time is drastically decreased (from one day to few hours) without any noticeable loss in solution quality.