Concise analysis using implication algebras for task-local memory optimisation Leo White and Alan Mycroft Computer Laboratory, University of Cambridge William Gates Building, 15 JJ Thomson Avenue, Cambridge CB3 0FD, UK

First Page		Document Content
Date: 2013-04-17 08:32:31 Software engineering Application programming interfaces Fortran OpenMP Model theory Task parallelism Stack Stable model semantics Term algebra Computing Computer programming Parallel computing		Concise analysis using implication algebras for task-local memory optimisation Leo White and Alan Mycroft Computer Laboratory, University of Cambridge William Gates Building, 15 JJ Thomson Avenue, Cambridge CB3 0FD, UK Add to Reading List Source URL: www.cl.cam.ac.uk Download Document from Source Website File Size: 361,61 KB Share Document on Facebook

	Extended abstract: Type oriented programming for task based parallelism 1 Nick Brown DocID: 1tLKA - View Document
	OpenMP Task Parallelism for Faster Genomic Data Processing Nathan T. Weeks Introduction: The Genomics Big Data Problem Genomic sequencing is being leveraged for a wide range of applications such as helping plant breeders DocID: 1tKze - View Document
	Exploiting Vector and Multicore Parallelism for Recursive, Data- and Task-Parallel Programs Bin Ren Sriram Krishnamoorthy DocID: 1tJmV - View Document
	Converting Data-Parallelism to Task-Parallelism by Rewrites Purely Functional Programs across Multiple GPUs Bo Joel Svensson Michael Vollmer DocID: 1tBYE - View Document
	Task-parallel versus data-parallel library-based programming in multicore systems Diego Andrade, Basilio B. Fraguela University of A Coru˜na, Spain {dcanosa,basilio}@udc.es DocID: 1rtTH - View Document