Search for Author All Reviews
	Leiserson, Charles E.     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending Date Reviewed     1 - 5 of 7 reviews       Tapir: embedding recursive fork-join parallelism into LLVM’s intermediate representation Schardl T., Moses W., Leiserson C. ACM Transactions on Parallel Computing 6(4): 1-33, 2019.  Type: Article A typical compiler has a front end that analyzes the source text and converts it to a language-independent intermediate representation (IR) whose structure and operations support general-purpose optimization in the compiler’s...... Feb 22 2021     The Cilkview scalability analyzer He Y., Leiserson C., Leiserson W.  SPAA 2010 (Proc. of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures, Thira, Santorini, Greece, Jun 13-15, 2010) 145-156, 2010.  Type: Proceedings The paper presents Cilkview, a Pin dynamic instrumentation-based tool that analyzes the scalability of a multithreaded application. It provides theoretical background and outlines the applicability of the analysis framework....... Nov 29 2010     Introduction to algorithms Cormen T., Leiserson C., Rivest R., Stein C., The MIT Press, Cambridge, MA, 2009. 1312 pp.  Type: Book (9780262033848) Computers are widely used all over the world. To benefit from them fully, it is essential to employ efficient algorithms when solving problems using computers. Efficient algorithms require less runtime and memory than other algorithms....... Jan 21 2010     Scheduling multithreaded computations by work stealing Blumofe R., Leiserson C. Journal of the ACM 46(5): 720-748, 1999.  Type: Article A randomized work-stealing algorithm for scheduling fully strict multithreaded computation on MIMD computers is proposed. A formula bounding the algorithm’s expected execution time on a fixed number of processors is given and...... Jun 1 2000     Space-Efficient Scheduling of Multithreaded Computations Blumofe R., Leiserson C. SIAM Journal on Computing 27(1): 202-229, 1998.  Type: Article The authors consider the problem of scheduling dynamic parallel computations to achieve linear speedup without using significantly more space per processor than that required for single-processor execution. Using a new graph-theoretic ...... Dec 1 1998     Display 510152550100 per column
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy