Exploiting storage redundancy to speed up randomized shared memory simulations

Author： auf der Heide F.M. Scheideler C. Stemann V.

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.162, Iss.2, 1996-08, pp. : 245-281

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Exploiting resolution proofs to speed up LTL vacuity detection for BMC

By Simmonds Jocelyn Davies Jessica Gurfinkel Arie Chechik Marsha

International Journal on Software Tools for Technology Transfer, Vol. 12, Iss. 5, 2010-09 ,pp. : 319-335

Springer Publishing Company

Access to resources Recommend Favorite

A tabu search algorithm based on new block properties and speed-up method for permutation flow-shop with finite intermediate storage

By Li Shaohua Tang Lixin

Journal of Intelligent Manufacturing, Vol. 16, Iss. 4-5, 2005-10 ,pp. : 463-477

Springer Publishing Company

Access to resources Recommend Favorite

Dynamic Partitioning of Shared Cache Memory

By Suh G. E. Rudolph L. Devadas S.

The Journal of Supercomputing, Vol. 28, Iss. 1, 2004-04 ,pp. : 7-26

Springer Publishing Company

Access to resources Recommend Favorite

Shared Memory Implementation of the Gamma-Operation

By Gladitz K. Kuchen H.

Journal of Symbolic Computation, Vol. 21, Iss. 4, 1996-04 ,pp. : 577-591

Academic Press

Access to resources Recommend Favorite

Exploiting redundancy to boost performance in a RAID-10 style cluster-based file system

By Zhu Yifeng Jiang Hong Qin Xiao Feng Dan Swanson David

Cluster Computing, Vol. 9, Iss. 4, 2006-10 ,pp. : 433-447

Springer Publishing Company

Access to resources Recommend Favorite