Daniel Ellard
Harvard University
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Daniel Ellard.
international conference on autonomic computing | 2004
Michael P. Mesnier; Eno Thereska; Gregory R. Ganger; Daniel Ellard; Margo I. Seltzer
To tune and manage themselves, file and storage systems must understand key properties (e.g., access pattern, lifetime, size) of their various files. This paper describes how systems can automatically learn to classify the properties of files (e.g., read-only access pattern, short-lived, small in size) and predict the properties of new files, as they are created, by exploiting the strong associations between a files properties and the names and attributes assigned to it. These associations exist, strongly but differently, in each of four real NFS environments studied. Decision tree classifiers can automatically identify and model such associations, providing prediction accuracies that often exceed 90%. Such predictions can be used to select storage policies (e.g., disk allocation schemes and replication factors) for individual files. Further, changes in associations can expose information about applications, helping autonomic system components distinguish growth from fundamental change.
workshop on computer architecture education | 2002
Daniel Ellard; David A. Holland; Nicholas A. Murphy; Margo I. Seltzer
Ant-32 is a new processor architecture designed specifically to address the pedagogical needs of teaching many subjects, including assembly language programming, machine architecture, compilers, operating systems, and VLSI design. This paper discusses our motivation for creating Ant-32 and the philosophy we used to guide our design decisions and gives a high-level description of the resulting design.
workshop on computer architecture education | 1998
Daniel Ellard; Penelope A. Ellard; James Megquier; J. Bradely Chen
A central goal of high-level programming languages, such as those we use to teach introductory computer science courses, is to provide an abstraction that hides the complexity and idiosyncrasies of computer hardware. Although programming languages are effective at achieving this goal, certain properties of computer hardware cannot be hidden, or are useful for students to know about. As a consequence, many of the greatest conceptual challenges for beginning programmers arise from a lack of understanding of the basic properties of the hardware upon which computer programs execute. To address this problem, we have developed a simple virtual machine called ANT for use in our introductory computer science (CS1) curriculum. ANT is designed to be simple enough that a CS1 student can quickly understand it, while at the same time providing an accurate model of many important properties of computer hardware. After two years of experience with ANT in our CS1 course, we believe it is a valuable tool for helping young students understand how programs and data are represented in a computer system.
file and storage technologies | 2003
Daniel Ellard; Jonathan Ledlie; Pia Malkani; Margo I. Seltzer
usenix large installation systems administration conference | 2003
Daniel Ellard; Margo I. Seltzer
usenix annual technical conference | 2003
Daniel Ellard; Margo I. Seltzer
Archive | 2003
Daniel Ellard; Michael P. Mesnier; Eno Thereska; Gregory R. Ganger; Margo I. Seltzer
Archive | 2003
Daniel Ellard; Jonathan Ledlie; Margo I. Seltzer
Archive | 2004
Margo I. Seltzer; Daniel Ellard
Archive | 2003
Daniel Ellard; James Megquier