Sciweavers

309 search results - page 26 / 62
» A Comparative Revisitation of Some Program Transformation Te...
Sort
View
ACMMSP
2005
ACM
101views Hardware» more  ACMMSP 2005»
14 years 1 months ago
Transparent pointer compression for linked data structures
64-bit address spaces are increasingly important for modern applications, but they come at a price: pointers use twice as much memory, reducing the effective cache capacity and m...
Chris Lattner, Vikram S. Adve
DATE
2007
IEEE
150views Hardware» more  DATE 2007»
14 years 1 months ago
Fast memory footprint estimation based on maximal dependency vector calculation
In data dominated applications, loop transformations have a huge impact on the lifetime of array data and therefore on memory footprint. Since a locally optimal loop transformatio...
Qubo Hu, Arnout Vandecappelle, Per Gunnar Kjeldsbe...
POPL
2012
ACM
12 years 3 months ago
A compiler and run-time system for network programming languages
Software-defined networks (SDNs) are a new implementation architecture in which a controller machine manages a distributed collection of switches, by instructing them to install ...
Christopher Monsanto, Nate Foster, Rob Harrison, D...
SEMWEB
2004
Springer
14 years 27 days ago
An API for Ontology Alignment
Ontologies are seen as the solution to data heterogeneity on the web. However, the available ontologies are themselves source of heterogeneity. This can be overcome by aligning on...
Jérôme Euzenat
ICSE
2005
IEEE-ACM
14 years 7 months ago
A multiple case study on the impact of pair programming on product quality
Pair programming is a programming technique in which two programmers use one computer to work together on the same task. There is an ongoing debate over the value of pair programm...
Hanna Hulkko, Pekka Abrahamsson