Add to ORKGThesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1994.Includes bibliographical references (p. 107-109).by Satyan R. Coorg.Ph.D
This papers presents an approach to statement-level independent partitioning of uniform recurrences,...
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer S...
Abstract In this paper, we propose separation set partitioning algorithm for partitioning nonstrict ...
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Compute...
In this paper we present substantially improved thread partitioning algorithms for modern implicitly...
In this paper we present substantially improved thread partitioning algorithms for modern implicitly...
Distributed-memory parallel computers are increasingly being used to provide high levels of performa...
εm is a high-level programming system which puts parallelism within the reach of scientists who are ...
Thesis (Ph. D.)--University of Rochester. Dept. of Computer Science, 2012.Speculative parallelizatio...
To exploit parallelism in Fortran code, this dissertation consists of a study of the following three...
AbstractThis paper studies parallel recursion. The trace specification language used in this paper i...
Partial evaluation has been applied to compiler optimization and generation for decades. Most of the...
textThis dissertation introduces Pikse, a novel methodology for more effective and efficient checkin...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer...
This papers presents an approach to statement-level independent partitioning of uniform recurrences,...
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer S...
Abstract In this paper, we propose separation set partitioning algorithm for partitioning nonstrict ...
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Compute...
In this paper we present substantially improved thread partitioning algorithms for modern implicitly...
In this paper we present substantially improved thread partitioning algorithms for modern implicitly...
Distributed-memory parallel computers are increasingly being used to provide high levels of performa...
εm is a high-level programming system which puts parallelism within the reach of scientists who are ...
Thesis (Ph. D.)--University of Rochester. Dept. of Computer Science, 2012.Speculative parallelizatio...
To exploit parallelism in Fortran code, this dissertation consists of a study of the following three...
AbstractThis paper studies parallel recursion. The trace specification language used in this paper i...
Partial evaluation has been applied to compiler optimization and generation for decades. Most of the...
textThis dissertation introduces Pikse, a novel methodology for more effective and efficient checkin...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer...
This papers presents an approach to statement-level independent partitioning of uniform recurrences,...
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer S...
Abstract In this paper, we propose separation set partitioning algorithm for partitioning nonstrict ...