Sciweavers

2030 search results - page 191 / 406
» Designing Complex Software Implementation Programs
Sort
View
SIGSOFT
2003
ACM
16 years 3 months ago
Protecting C programs from attacks via invalid pointer dereferences
Writes via unchecked pointer dereferences rank high among vulnerabilities most often exploited by malicious code. The most common attacks use an unchecked string copy to cause a b...
Suan Hsi Yong, Susan Horwitz
144
Voted
LCTRTS
2005
Springer
15 years 8 months ago
Cache aware optimization of stream programs
Effective use of the memory hierarchy is critical for achieving high performance on embedded systems. We focus on the class of streaming applications, which is increasingly preval...
Janis Sermulins, William Thies, Rodric M. Rabbah, ...
DELTA
2004
IEEE
15 years 6 months ago
Arithmetic Transformations to Maximise the Use of Compressor Trees
Complex arithmetic computations, especially if derived from bit-level software descriptions, can be very inefficient if implemented directly in hardware (e.g., by translation of t...
Paolo Ienne, Ajay K. Verma
122
Voted
CHES
2009
Springer
230views Cryptology» more  CHES 2009»
16 years 3 months ago
Designing an ASIP for Cryptographic Pairings over Barreto-Naehrig Curves
Abstract. This paper presents a design-space exploration of an applicationspecific instruction-set processor (ASIP) for the computation of various cryptographic pairings over Barre...
David Kammler, Diandian Zhang, Dominik Auras, Gerd...
112
Voted
SPAA
2003
ACM
15 years 7 months ago
Throughput-centric routing algorithm design
The increasing application space of interconnection networks now encompasses several applications, such as packet routing and I/O interconnect, where the throughput of a routing a...
Brian Towles, William J. Dally, Stephen P. Boyd