|
Main
Page
Graduate
Program
Undergraduate
Program
Course Information
Course
Catalog
Course
Web Pages
Our
Research
Research Areas
Research
Projects
Publications
Faculty
Graduate
Students
Research
and Technical Staff
Administrative
Staff
Alumni
Calendars
Computing Facilities
Yale
Computer Science FAQ
Yale Workstation Support
Computing
Lab
AfterCollege
Job Resource
Contact
Us
History
Life in the Department
Life About Town
Directions
Faculty
Positions
City
of New Haven
Yale Applied Mathematics
Yale Faculty of Engineering
Yale
University Home Page
Google Search
Yale Info Phonebook
Internal |
|
Nicholas Carriero
Research Scientist of Computer Science
B.S., Brown University, 1980
M.S., The State University of New York, Stony Brook, 1983
Ph.D., Yale University, 1987
Joined Yale Faculty 1987
Personal
Homepage
Office location: AKW 106
Telephone: 203.432.1278
Nicholas Carriero's research centers on system issues in the development
and deployment of software tools for parallelism.
Working with David Gelernter and the Linda group at Yale, Carriero has
developed varants of C and Fortran that provide Linda's coordination model.
this work hs included the C-Linda precompiler and analyzer, and support
kernels for shared-memory multiprocessors. He has also directed work on
tools for debugging and visualizing Linda codes
Carriero's current work includes refinement of existing implementation
of the Lnda coordination model, development of new implementations, extension
of the model, and exploration of parallel programming methodologies. Adaptive
parallelism, distributed computing, and "non-traditional" coordination
applicaitons are topics of particular emphasis.
| Representative Publications |
 |
"Adpative Parallelism
and Piranha," with E. Freeman, D. Gelernter, and D. Kaminsky,
IEEE Computer, 28(4), 1995 |
 |
"A Program Building
Tool for Parallel Applications," with S. Ahmed and D. Gelernter,
DIMACS Workshop of Specification of Paralled Algorithms,
May 1994. |
 |
"Coordination Languages
and their Significance," with D. Gelernter, Communications
of the ACM, 35(2), 1992. |

|
 |