Sciweavers

1686 search results - page 167 / 338
» Programs as polygraphs: computability and complexity
Sort
View
ICFP
2008
ACM
16 years 6 months ago
A scheduling framework for general-purpose parallel languages
The trend in microprocessor design toward multicore and manycore processors means that future performance gains in software will largely come from harnessing parallelism. To reali...
Matthew Fluet, Mike Rainey, John H. Reppy
JPDC
2000
141views more  JPDC 2000»
15 years 6 months ago
A System for Evaluating Performance and Cost of SIMD Array Designs
: SIMD arrays are likely to become increasingly important as coprocessors in domain specific systems as architects continue to leverage RAM technology in their design. The problem ...
Martin C. Herbordt, Jade Cravy, Renoy Sam, Owais K...
ASPLOS
2012
ACM
14 years 2 months ago
Understanding modern device drivers
Device drivers are the single largest contributor to operating-system kernel code with over 5 million lines of code in the Linux kernel, and cause significant complexity, bugs an...
Asim Kadav, Michael M. Swift
ICFP
2010
ACM
15 years 7 months ago
Distance makes the types grow stronger: a calculus for differential privacy
We want assurances that sensitive information will not be disclosed when aggregate data derived from a database is published. Differential privacy offers a strong statistical guar...
Jason Reed, Benjamin C. Pierce
COMPSAC
2002
IEEE
15 years 11 months ago
A Graphically Based Language for Constructing, Executing and Analysing Models of Software Systems
With computer systems becoming ever larger and more complex, the cost and effort associated with their construction is increasing and the systems are now sufficiently complex that...
Robert John Walters