312 search results - page 35 / 63 » Scalable browsing for large collections: a case study |
IWPC
2000
IEEE
14 years 2 days ago
2000
IEEE
Call graphs are commonly used as input for automatic clustering algorithms, the goal of which is to extract the high level structure of the program under study. Determining the ca...
IWPC
1999
IEEE
13 years 12 months ago
1999
IEEE
In a typical COBOL program, the data division consists of 50% of the lines of code. Automatic type inference can help to understand the large collections of variable declarations ...
CN
2002
13 years 7 months ago
2002
To support quality of service guarantees in a scalable manner, aggregate scheduling has attracted a lot of attention in the networking community. However, while there are a large ...
IPPS
2009
IEEE
14 years 2 months ago
2009
IEEE
Parallel applications typically run in batch mode, sometimes after long waits in a scheduler queue. In some situations, it would be desirable to interactively add new functionalit...
IPPS
2007
IEEE
14 years 2 months ago
2007
IEEE
Desktop grids have traditionally focused on executing computation intensive workloads. Can they also be used to execute data-intensive workloads? To answer this question, we prese...