Cache-oblivious algorithms have the advantage of achieving good sequential cache complexity across all levels of a multi-level cache hierarchy, regardless of the specifics (cache...
Guy E. Blelloch, Phillip B. Gibbons, Harsha Vardha...
Abstract. Exploiting the full computational power of current hierarchical multiprocessor machines requires a very careful distribution of threads and data among the underlying non-...
Advances in grid computing have recently sparkled the research and development of Grid problem solving environments for complex design. Parallelism in the form of distributed compu...
Despite the explosive new interest in Distributed Computing, bringing software — particularly legacy software — to parallel platforms remains a daunting task. The Self Distrib...
Bernd Klauer, Frank Eschmann, Ronald Moore, Klaus ...
— This paper presents Salsa, a novel, decentralized and asynchronous realization of the “replica exchange” algorithm for simulating the structure, function, folding, and dyna...
Li Zhang, Manish Parashar, Emilio Gallicchio, Rona...