Titlebook: Parallel Processing and Applied Mathematics, Part II; 8th International Co Roman Wyrzykowski,Jack Dongarra,Jerzy Wasniewski Conference proc

歸功于

江湖郎中

逃避現(xiàn)實(shí)

Comparison of Program Task Scheduling Algorithms for Dynamic SMP Clusters with Communication on the Fly in Systems on Chip (SoC) technology. SoC modules are built of a set of processors, memory modules and a multi–bus interconnection network. A set of such SoCs is interconnected by a global communication network. Inter–processor communication inside SoC modules uses a novel technique of data transfer

清楚

潛移默化

Online Scheduling of Parallel Jobs on Hypercubes: Maximizing the Throughputine on a subcube of processors. The objective is to maximize the number of early jobs. We provide a 1.6-competitive algorithm for the problem and prove that no deterministic algorithm is better than 1.4-competitive.

粗俗人

Verification of Causality Requirements in Java Memory Model Is Undecidablealization are causality requirements that serve to provide safety and security guarantees for incorrectly synchronized Java programs. In this paper, we consider the problem of verifying whether an execution of a multithreaded Java program satisfies these causality requirements and show that this pro

嚙齒動(dòng)物

insolence

品牌

Performance Debugging of Parallel Compression on Multicore Machines, which are able to provide work for each core. Creating a scalable parallel/multithreaded application efficiently using available cores is a difficult task, especially if I/O performance must be considered as well. We consider a multithreaded database loader with a compressing function. The perform

bleach