Sciweavers

10055 search results - page 1362 / 2011
» Structured programming using processes
Sort
View
ASPLOS
1996
ACM
15 years 10 months ago
Shasta: A Low Overhead, Software-Only Approach for Supporting Fine-Grain Shared Memory
This paper describes Shasta, a system that supports a shared address space in software on clusters of computers with physically distributed memory. A unique aspect of Shasta compa...
Daniel J. Scales, Kourosh Gharachorloo, Chandramoh...
ASPLOS
2006
ACM
15 years 8 months ago
Tradeoffs in fine-grained heap memory protection
Different uses of memory protection schemes have different needs in terms of granularity. For example, heap security can benefit from chunk separation (by using protected "pa...
Jianli Shen, Guru Venkataramani, Milos Prvulovic
VLDB
2007
ACM
145views Database» more  VLDB 2007»
16 years 6 months ago
Executing Stream Joins on the Cell Processor
Low-latency and high-throughput processing are key requirements of data stream management systems (DSMSs). Hence, multi-core processors that provide high aggregate processing capa...
Bugra Gedik, Philip S. Yu, Rajesh Bordawekar
GG
2008
Springer
15 years 7 months ago
Transformation-Based Operationalization of Graph Languages
Graph Languages1 emerged during the seventies from the necessity to process data structures with complex interrelations. Nowadays, various variants of these languages can be found...
Erhard Weinell
BMCBI
2010
102views more  BMCBI 2010»
15 years 6 months ago
SAMPLEX: Automatic mapping of perturbed and unperturbed regions of proteins and complexes
Background: The activity of proteins within the cell is characterized by their motions, flexibility, interactions or even the particularly intriguing case of partially unfolded st...
Mickaël Krzeminski, Karine Loth, Rolf Boelens...
« Prev « First page 1362 / 2011 Last » Next »