Sciweavers

166 search results - page 24 / 34
» Efficient worst case timing analysis of data caching
Sort
View
BMCBI
2007
119views more  BMCBI 2007»
13 years 7 months ago
Conceptual-level workflow modeling of scientific experiments using NMR as a case study
Background: Scientific workflows improve the process of scientific experiments by making computations explicit, underscoring data flow, and emphasizing the participation of humans...
Kacy K. Verdi, Heidi J. C. Ellis, Michael R. Gryk
SIROCCO
2000
13 years 9 months ago
Cooperative computing with fragmentable and mergeable groups
ABSTRACT: This work considers the problem of performing a set of N tasks on a set of P cooperating message-passing processors (P N). The processors use a group communication servi...
Chryssis Georgiou, Alexander A. Shvartsman
BMCBI
2011
12 years 11 months ago
A Simple Approach to Ranking Differentially Expressed Gene Expression Time Courses through Gaussian Process Regression
Background: The analysis of gene expression from time series underpins many biological studies. Two basic forms of analysis recur for data of this type: removing inactive (quiet) ...
Alfredo A. Kalaitzis, Neil D. Lawrence
PLDI
2005
ACM
14 years 1 months ago
Automatic pool allocation: improving performance by controlling data structure layout in the heap
This paper describes Automatic Pool Allocation, a transformation framework that segregates distinct instances of heap-based data structures into seperate memory pools and allows h...
Chris Lattner, Vikram S. Adve
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