Accelerating Irregular Computations with Hardware Transactional Memory and Active Messages Maciej Besta Torsten Hoefler

First Page		Document Content
Date: 2015-09-14 07:27:20 Graph theory Mathematics Computing Concurrency control Transaction processing NP-complete problems Computer memory Transactional memory Vertex Breadth-first search Graph coloring Transactional Synchronization Extensions		Accelerating Irregular Computations with Hardware Transactional Memory and Active Messages Maciej Besta Torsten Hoefler Add to Reading List Source URL: htor.inf.ethz.ch Download Document from Source Website File Size: 908,72 KB Share Document on Facebook

	Proc. Int. Cong. of Math. – 2018 Rio de Janeiro, Vol–2602) CONFORMAL FIELD THEORY, VERTEX OPERATOR ALGEBRAS AND OPERATOR ALGEBRAS Yasuyuki Kawahigashi (河東泰之) DocID: 1xVLK - View Document
	On the scaling limit of finite vertex transitive graphs with large diameter Itai Benjamini Romain Tessera∗ DocID: 1xVtW - View Document
	LOCAL-TO-GLOBAL RIGIDITY OF BRUHAT-TITS BUILDINGS MIKAEL DE LA SALLE AND ROMAIN TESSERA Abstract. A vertex-transitive graph X is called local-to-global rigid if there exists R such that every other graph whose balls of r DocID: 1xU1g - View Document
	CHARACTERIZING A VERTEX-TRANSITIVE GRAPH BY A LARGE BALL MIKAEL DE LA SALLE AND ROMAIN TESSERA, WITH AN APPENDIX BY JEAN-CLAUDE SIKORAV Abstract. It is well-known that a complete Riemannian manifold M which is locally is DocID: 1xTva - View Document
	OPERATING MANUAL VERTEX STANDARD CO., LTDNakameguro, Meguro-Ku, Tokyo, Japan VERTEX STANDARD DocID: 1vpgf - View Document