Share This Author
A public-key infrastructure for key distribution in TinyOS based on elliptic curve cryptography
- D. Malan, M. Welsh, Michaela Smith
- Computer Science, MathematicsFirst Annual IEEE Communications Society…
- 4 October 2004
It is demonstrated that public keys can be generated within 34 seconds, and that shared secrets can be distributed among nodes in a sensor network within the same, using just over 1 kilobyte of SRAM and 34 kilobytes of ROM.
A high-performance microarchitecture with hardware-programmable functional units
- R. Razdan, Michaela Smith
- Computer ScienceProceedings of MICRO-27. The 27th Annual IEEE/ACM…
- 30 November 1994
This paper explores a novel way to incorporate hardware-programmable resources into a processor microarchitecture to improve the performance of general-purpose applications. Through a coupling of…
Procedure placement using temporal-ordering information
This paper describes an algorithm for procedure placement, one type of code placement, that signicantly differs from previous approaches in the type of information used to drive the placement algorithm, and gathers temporal-ordering information that summarizes the interleaving of procedures in a program trace.
Implementing public-key infrastructure for sensor networks
A critical evaluation of the first known implementation of elliptic curve cryptography over F2p for sensor networks based on the 8-bit, 7.3828-MHz MICA2 mote is presented, demonstrating that public keys can be generated within 34 seconds and that shared secrets can be distributed among nodes in a sensor network within the same time.
Improving Performance Isolation on Chip Multiprocessors via an Operating System Scheduler
- Alexandra Fedorova, M. Seltzer, Michaela Smith
- Computer Science16th International Conference on Parallel…
- 15 September 2007
A new operating system scheduling algorithm that improves performance isolation on chip multiprocessors (CMP) by ensuring that the application runs as quickly as it would under fair cache allocation, regardless of how the cache is actually allocated.
System support for automatic profiling and optimization
This paper focuses on the operating system support that is required to collect and manage profile information on an end-user's workstation in an automatic, continuous, and transparent manner and shows that Morph can use statistical profiles to improve application performance.
Efficient superscalar performance through boosting
This work has incorporated boosting into a trace-based, global scheduling algorithm that exploits ILP without adversely affecting the instruction count of a program and uses this algorithm and estimates of the boosting hardware involved to evaluate how much speculative execution support is really necessary to achieve good performance.
A generalized algorithm for graph-coloring register allocation
This work presents a generalization of graph-coloring register allocation that handles two characteristics commonly found in commercial architectures, and adapts easily to a new target machine, requiring only the sets of names in the registers and a map of the register aliases.
Quality and speed in linear-scan register allocation
This paper implements both register allocators within the Machine SUIF extension of the Stanford SUIF compiler system and describes improvements to the linear-scan approach that allow it to produce code of a quality near to that produced by graph coloring.
Boosting beyond static scheduling in a superscalar processor
- Michaela Smith, M. Lam, M. Horowitz
- Computer Science Proceedings. The 17th Annual International…
- 1 May 1990
A superscalar processor that combines the best qualities of static and dynamic instruction scheduling to increase the performance of nonnumerical applications is described. The architecture performs…