Name
Abstract | ||
|---|---|---|
Reconciling the conflicting goals of simplicity and efficiency has traditionally been a major challenge in the development of concurrent programs. Seuss is a methodology for concurrent programming that attempts to achieve the right balance between these competing concerns. The goal of Seuss is to permit a disentanglement of the issues of correctness and efficiency. On the one hand, programmers can reason about Seuss programs by assuming a single thread of control; on the other hand, implementation designers can exploit design knowledge in achieving better performance. This paper provides a short overview of the Seuss programming model and describes the main challenges in designing an efficient implementation of Seuss and in applying Seuss to large applications. |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1109/PDSE.1997.596848 | PDSE |
Keywords | Field | DocType |
concurrent program,doctor ordered,efficient implementation,concurrent programming,design knowledge,conflicting goal,better performance,seuss programming model,implementation designer,large application,seuss program,distributed programming,correctness,cloning,parallel programming,programming model,terminology,efficiency | File Transfer Protocol,Design knowledge,Programming language,Yarn,Programming paradigm,Terminology,Computer science,Correctness,Exploit,Concurrent computing | Conference |
ISBN | Citations | PageRank |
0-8186-8043-1 | 0 | 0.34 |
References | Authors | |
6 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lorenzo Alvisi | 1 | 2932 | 166.23 |
| Rajeev Joshi | 2 | 0 | 0.34 |
| Calvin Lin | 3 | 0 | 0.34 |
| Jayadev Misra | 4 | 3147 | 771.78 |