Titlebook: Network and Parallel Computing; 10th IFIP Internatio Ching-Hsien Hsu,Xiaoming Li,Ran Zheng Conference proceedings 2013 IFIP International F

Novice

書目名稱Network and Parallel Computing影響因子(影響力)




書目名稱Network and Parallel Computing影響因子(影響力)學科排名




書目名稱Network and Parallel Computing網(wǎng)絡公開度




書目名稱Network and Parallel Computing網(wǎng)絡公開度學科排名




書目名稱Network and Parallel Computing被引頻次




書目名稱Network and Parallel Computing被引頻次學科排名




書目名稱Network and Parallel Computing年度引用




書目名稱Network and Parallel Computing年度引用學科排名




書目名稱Network and Parallel Computing讀者反饋




書目名稱Network and Parallel Computing讀者反饋學科排名

Radiation

A Network-Aware Virtual Machine Allocation in Cloud Datacentermunication cost and latency between servers, with the number of VMs, VM configurations and communication bandwidths are satisfied to users. Specifically, a two-dimensional knapsack algorithm is applied to solve this problem. The algorithm is evaluated and compared with other ones through experiments, which shows satisfying results.

厚顏無恥

遷移

Speeding Up Galois Field Arithmetic on Intel MIC Architectureores on chip and very wide 512-bit SIMD instructions, attractive for data intensive applications. This paper demonstrates how to leverage SIMD instructions and shared memory multiprocessing on MIC to perform Galois Field arithmetic. The experiments show that the performance of the computation is significantly enhanced.

冬眠

Conditional Diagnosability of Complete Josephus Cubeswork. As a new measure of fault tolerance, conditional diagnosability can better evaluate the real diagnosability of interconnection networks. In this paper, we derive the conditional diagnosability of the multiprocessor systems in terms of Complete Josephus Cubes .. (.?≥?8) under the comparison model.

擋泥板

Terminal

Access Annotation for Safe Program Parallelizationves a quadratic-time algorithm to check the exponential number of parallel interleavings. The paper then uses the annotation interface to parallelize several programs with uncertain parallelism. It demonstrates the efficiency of program monitoring by a performance comparison with OpenMP, which does not monitor data access or guarantee safety.

palliate

A Fine-Grained Pipelined Implementation of LU Decomposition on SIMD Processorse the high pipeline parallelism and the high efficient memory access. Experimental results show that the proposed technology can achieve a speedup of 1.04x to 1.82x over the native algorithm and can achieve about 89% of the peak performance on the SIMD processor.

oxidize

Totoro: A Scalable and Fault-Tolerant Data Center Network by Using Backup Portons of nodes. We also design a fault-tolerant routing protocol. Its capability is very close to the performance bound. Our experiments show that Totoro is a viable interconnection structure for data centers.

Dedication