939 search results - page 101 / 188 » Improving Dynamic Data Analysis with Aspect-Oriented Program... |
214
click to vote
SIGMOD
2007
ACM
16 years 4 months ago
2007
ACM
In this report, we provide a summary1 of the First Int'l VLDB Workshop on Clean Databases (CleanDB 2006), which took place at Seoul, Korea, on September 11, 2006, in conjunct...
154
click to vote
CGO
2008
IEEE
15 years 10 months ago
2008
IEEE
Array inlining expands the concepts of object inlining to arrays. Groups of objects and arrays that reference each other are placed consecutively in memory so that their relative ...
132
click to vote
COMPSAC
1999
IEEE
15 years 8 months ago
1999
IEEE
As the complexity of software systems increases, so need for a good mechanism of abstraction. architecture design is an abstraction, hiding an immense amount of details about the ...
149
click to vote
PPOPP
1999
ACM
15 years 8 months ago
1999
ACM
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory...
133
click to vote
SC
2009
ACM
15 years 10 months ago
2009
ACM
This paper presents a dynamic task scheduling approach to executing dense linear algebra algorithms on multicore systems (either shared-memory or distributed-memory). We use a tas...