Travelled to:
1 × Ireland
1 × United Kingdom
2 × Canada
9 × USA
Collaborated with:
M.Budiu D.R.Koes T.Chelcea G.Venkataramani F.Cruz R.Rocha K.E.Schauser D.Koes D.E.Culler H.Aït-Kaci A.Podelski F.Pfenning M.P.Ashley-Rollman P.Lee P.Pillai J.Campbell M.Mishra T.J.Callahan
Talks about:
program (8) spatial (3) execut (3) comput (3) logic (3) progress (2) languag (2) thread (2) strict (2) regist (2)
Person: Seth Copen Goldstein
DBLP: Goldstein:Seth_Copen
Contributed to:
Wrote 15 papers:
- ICLP-2015-CruzRG #data-driven #logic programming #parallel #source code #thread
- Thread-Aware Logic Programming for Data-Driven Parallel Programs (FC, RR, SCG), pp. 191–203.
- ICLP-J-2014-CruzRGP #concurrent #graph #linear #logic programming #programming language
- A Linear Logic Programming Language for Concurrent Programming over Graph Structures (FC, RR, SCG, FP), pp. 493–507.
- PPDP-2014-CruzRG #design #implementation #linear #logic programming #parallel #source code #thread #virtual machine
- Design and Implementation of a Multithreaded Virtual Machine for Executing Linear Logic Programs (FC, RR, SCG), pp. 43–54.
- ICLP-2009-Ashley-RollmanLGPC #independence #scalability
- A Language for Large Ensembles of Independently Executing Nodes (MPAR, PL, SCG, PP, JC), pp. 265–280.
- CGO-2008-KoesG #graph
- Near-optimal instruction selection on dags (DRK, SCG), pp. 45–54.
- DAC-2007-ChelceaVG #self
- Self-Resetting Latches for Asynchronous Micro-Pipelines (TC, GV, SCG), pp. 986–989.
- DAC-2007-VenkataramaniBCG #analysis
- Global Critical Path: A Tool for System-Level Timing Analysis (GV, MB, TC, SCG), pp. 783–786.
- ASPLOS-2006-MishraCCVGB #execution #named
- Tartan: evaluating spatial computation for whole program execution (MM, TJC, TC, GV, SCG, MB), pp. 163–174.
- PLDI-2006-KoesG
- A global progressive register allocator (DRK, SCG), pp. 204–215.
- CGO-2005-KoesG #architecture
- A Progressive Register Allocator for Irregular Architectures (DK, SCG), pp. 269–280.
- ASPLOS-2004-BudiuVCG
- Spatial computation (MB, GV, TC, SCG), pp. 14–26.
- CGO-2003-BudiuG #memory management #optimisation
- Optimizing Memory Accesses For Spatial Computation (MB, SCG), pp. 216–227.
- FPCA-1995-SchauserG #how #question #source code #strict
- How Much Non-Strictness do Lenient Programs Require? (KES, SCG), pp. 216–225.
- POPL-1995-SchauserCG #algorithm #clustering #constraints #source code #strict #thread
- Separation Constraint Partitioning — A New Algorithm for Partitioning Non-strict Programs into Sequential Threads (KES, DEC, SCG), pp. 259–271.
- ILPS-1993-Ait-KaciPG #order #unification
- Order-Sorted Feature Theory Unification (HAK, AP, SCG), pp. 506–524.