Author image not provided
 David Tarditi

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article28.58
Citation Count543
Publication count19
Publication years1992-2007
Available for download12
Average downloads per article663.67
Downloads (cumulative)7,964
Downloads (12 Months)251
Downloads (6 Weeks)17
SEARCH
ROLE
Arrow RightAuthor only
· Other only
· All roles


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


19 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 19 of 19
Sort by:

1
September 2007 PACT '07: Proceedings of the 16th International Conference on Parallel Architecture and Compilation Techniques
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 3
Downloads (6 Weeks): 1,   Downloads (12 Months): 2,   Downloads (Overall): 156

Full text available: PDFPDF
Object-oriented programming encourages extensive use of fields in objects. Most object-oriented programs are also concurrent, due to a finalizer or user interface thread. The combination of concurrency and frequent use of fields presents an optimization challenge: it is difficult for an optimizer to establish invariants between fields at different points ...

2 published by ACM
March 2007 EuroSys '07: Proceedings of the 2nd ACM SIGOPS/EuroSys European Conference on Computer Systems 2007
Publisher: ACM
Bibliometrics:
Citation Count: 22
Downloads (6 Weeks): 4,   Downloads (12 Months): 34,   Downloads (Overall): 823

Full text available: PDFPDF
In most modern operating systems, a process is a hardware-protected abstraction for isolating code and data. This protection, however, is selective. Many common mechanisms---dynamic code loading, run-time code generation, shared memory, and intrusive system APIs---make the barrier between processes very permeable. This paper argues that this traditional open process architecture ...
Keywords: open process architecture, software isolated process (SIP), sealed process architecture, sealed kernel
Also published in:
June 2007  ACM SIGOPS Operating Systems Review - EuroSys'07 Conference Proceedings: Volume 41 Issue 3, June 2007

3 published by ACM
October 2006 ASPLOS XII: Proceedings of the 12th international conference on Architectural support for programming languages and operating systems
Publisher: ACM
Bibliometrics:
Citation Count: 90
Downloads (6 Weeks): 3,   Downloads (12 Months): 81,   Downloads (Overall): 2,322

Full text available: PDFPDF
GPUs are difficult to program for general-purpose uses. Programmers can either learn graphics APIs and convert their applications to use graphics pipeline operations or they can use stream programming abstractions of GPUs. We describe Accelerator, a system that uses data parallelism to program GPUs for general-purpose uses instead. Programmers use ...
Keywords: data parallelism, just-in time compilation, graphics processing units
Also published in:
October 2006  ACM SIGOPS Operating Systems Review - Proceedings of the 2006 ASPLOS Conference: Volume 40 Issue 5, December 2006 November 2006  ACM SIGPLAN Notices - Proceedings of the 2006 ASPLOS Conference: Volume 41 Issue 11, November 2006 October 2006  ACM SIGARCH Computer Architecture News - Proceedings of the 2006 ASPLOS Conference: Volume 34 Issue 5, December 2006

4 published by ACM
June 2006 ACM SIGPLAN Notices - Proceedings of the 2006 PLDI Conference: Volume 41 Issue 6, June 2006
Publisher: ACM
Bibliometrics:
Citation Count: 119
Downloads (6 Weeks): 2,   Downloads (12 Months): 26,   Downloads (Overall): 1,207

Full text available: PDFPDF
Atomic blocks allow programmers to delimit sections of code as 'atomic', leaving the language's implementation to enforce atomicity. Existing work has shown how to implement atomic blocks over word-based transactional memory that provides scalable multi-processor performance without requiring changes to the basic structure of objects in the heap. However, these ...
Keywords: critical regions, transactional memory, atomicity
Also published in:
June 2006  PLDI '06: Proceedings of the 27th ACM SIGPLAN Conference on Programming Language Design and Implementation

5
June 2005 HOTOS'05: Proceedings of the 10th conference on Hot Topics in Operating Systems - Volume 10
Publisher: USENIX Association
Bibliometrics:
Citation Count: 13

Contemporary software systems are beset by problems that create challenges and opportunities for broad new OS research. To illustrate, we describe five areas where broad OS research could significantly improve the current user experience. These areas are dependability, security, system configuration, system extension, and multi-processor programming. In each area we ...

6 published by ACM
January 2005 POPL '05: Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Publisher: ACM
Bibliometrics:
Citation Count: 14
Downloads (6 Weeks): 1,   Downloads (12 Months): 15,   Downloads (Overall): 372

Full text available: PdfPdf
Traditional class and object encodings are difficult to use in practical type-preserving compilers because of the complexity of the encodings. We propose a simple typed intermediate language for compiling object-oriented languages and prove its soundness. The key ideas are to preserve lightweight notions of classes and objects instead of compiling ...
Keywords: class and object encoding, typed intermediate language
Also published in:
January 2005  ACM SIGPLAN Notices - Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages: Volume 40 Issue 1, January 2005

7 published by ACM
April 2004 ACM SIGPLAN Notices - 20 Years of the ACM SIGPLAN Conference on Programming Language Design and Implementation 1979-1999: A Selection: Volume 39 Issue 4, April 2004
Publisher: ACM
Bibliometrics:
Citation Count: 3
Downloads (6 Weeks): 3,   Downloads (12 Months): 12,   Downloads (Overall): 269

Full text available: PDFPDF
The goal of the TIL project was to explore the use of Typed Intermediate Languages to produce high-performance native code from Standard ML (SML). We believed that existing SML compilers were doing a good job of conventional functional language optimizations, as one might find in a LISP compiler, but that ...

8 published by ACM
October 2000 ISMM '00: Proceedings of the 2nd international symposium on Memory management
Publisher: ACM
Bibliometrics:
Citation Count: 24
Downloads (6 Weeks): 1,   Downloads (12 Months): 14,   Downloads (Overall): 326

Full text available: PDFPDF
Many garbage-collected systems use a single garbage collection algorithm across all applications. It has long been known that this can produce poor performance on applications for which that collector is not well suited. In some systems, such as those that execute stand-alone compiled executables, an appropriate collector for each application ...
Also published in:
January 2001  ACM SIGPLAN Notices: Volume 36 Issue 1, Jan 2001

9 published by ACM
October 2000 ISMM '00: Proceedings of the 2nd international symposium on Memory management
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 0,   Downloads (12 Months): 5,   Downloads (Overall): 237

Full text available: PDFPDF
Garbage collection tables for finding pointers on the stack can be represented in 20-25% of the space previously reported. Live pointer information is often the same at many call sites because there are few pointers live across most call sites. This allows live pointer information to be represented compactly by ...
Also published in:
January 2001  ACM SIGPLAN Notices: Volume 36 Issue 1, Jan 2001

10
March 2000 Software—Practice & Experience: Volume 30 Issue 3, Mar.1.2000
Publisher: John Wiley & Sons, Inc.
Bibliometrics:
Citation Count: 34

Keywords: Java, compilers, optimization, language translation

11
December 1996 Lisp and Symbolic Computation: Volume 9 Issue 4, Dec. 1996
Publisher: Kluwer Academic Publishers
Bibliometrics:
Citation Count: 9


12 published by ACM
May 1996 PLDI '96: Proceedings of the ACM SIGPLAN 1996 conference on Programming language design and implementation
Publisher: ACM
Bibliometrics:
Citation Count: 139
Downloads (6 Weeks): 1,   Downloads (12 Months): 30,   Downloads (Overall): 521

Full text available: PDFPDF
Also published in:
May 1996  ACM SIGPLAN Notices: Volume 31 Issue 5, May 1996

13 published by ACM
August 1995 ACM Transactions on Computer Systems (TOCS): Volume 13 Issue 3, Aug. 1995
Publisher: ACM
Bibliometrics:
Citation Count: 18
Downloads (6 Weeks): 2,   Downloads (12 Months): 10,   Downloads (Overall): 524

Full text available: PDFPDF
Heap allocation with copying garbage collection is a general storage management technique for programming languages. It is believed to have poor memory system performance. To investigate this, we conducted an in-depth study of the memory system performance of heap allocation for memory systems found on many machines. We studied the ...
Keywords: automatic storage reclamation, copying garbage collection, garbage collection, generational garbage collection, write-buffer, heap allocation, subblock placement, write-back, write-miss policy, page mode, write through, write-policy

14
May 1995
Bibliometrics:
Citation Count: 2

We study the cost of storage management for garbage-collected programs compiled with the Standard ML of New Jersey compiler. We show that the cost of storage management is not the same as the time spent garbage collecting. For many of the programs, the time spent garbage collecting is less than ...

15 published by ACM
February 1994 POPL '94: Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Publisher: ACM
Bibliometrics:
Citation Count: 15
Downloads (6 Weeks): 0,   Downloads (12 Months): 6,   Downloads (Overall): 701

Full text available: PDFPDF
Heap allocation with copying garbage collection is believed to have poor memory subsystem performance. We conducted a study of the memory subsystem performance of heap allocation for memory subsystems found on many machines. We found that many machines support heap allocation poorly. However, with the appropriate memory subsystem organization, heap ...

16
January 1994 Lisp and Symbolic Computation: Volume 7 Issue 1, Jan. 1994
Publisher: Kluwer Academic Publishers
Bibliometrics:
Citation Count: 11

Keywords: continuation-passing style, continuations, functional programming, lazy evaluation, call-by-need

17
December 1993
Bibliometrics:
Citation Count: 3

Heap allocation with copying garbage collection is a general storage management technique for modern programming languages. It is believed to have poor memory subsystem performance. To investigate this, we conducted an in-depth study of the memory subsystem performance of heap allocation for memory subsystems found on many machines. We studied ...

18
December 1993
Bibliometrics:
Citation Count: 1

Heap allocation with copying garbage collection is believed to have poor memory subsystem performance. We conducted a study of the memory subsystem performance of heap allocation for memory subsystems found on many machines. We found that many machines support heap allocation poorly. However, with the appropriate memory subsystem organization, heap ...

19 published by ACM
June 1992 ACM Letters on Programming Languages and Systems (LOPLAS): Volume 1 Issue 2, June 1992
Publisher: ACM
Bibliometrics:
Citation Count: 21
Downloads (6 Weeks): 1,   Downloads (12 Months): 11,   Downloads (Overall): 495

Full text available: PDFPDF
C has been used as a portable target language for implementing languages like Standard ML and Scheme. Previous efforts at compiling these languages to C have produced efficient code, but have compromised on portability and proper tail recursion. We show how to compile Standard ML to C wihout making such ...
Keywords: continuation-passing style, scheme, compilation to C, standard ML



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us