Sciweavers

62 search results - page 12 / 13
» Realizability of Dynamic MSC Languages
Sort
View
CF
2005
ACM
13 years 7 months ago
A case for a working-set-based memory hierarchy
Modern microprocessor designs continue to obtain impressive performance gains through increasing clock rates and advances in the parallelism obtained via micro-architecture design...
Steve Carr, Soner Önder
JODL
2000
194views more  JODL 2000»
13 years 5 months ago
An open electronic marketplace through agent-based workflows: MOPPET
We propose an electronic marketplace architecture, called MOPPET, where the commerce processes in the marketplace are modeled as adaptable agent-based workflows. The higher level ...
Sena Nural Arpinar, Asuman Dogac, Nesime Tatbul
SIGMOD
2008
ACM
169views Database» more  SIGMOD 2008»
14 years 5 months ago
MCDB: a monte carlo approach to managing uncertain data
To deal with data uncertainty, existing probabilistic database systems augment tuples with attribute-level or tuple-level probability values, which are loaded into the database al...
Ravi Jampani, Fei Xu, Mingxi Wu, Luis Leopoldo Per...
CGO
2008
IEEE
13 years 12 months ago
Latency-tolerant software pipelining in a production compiler
In this paper we investigate the benefit of scheduling non-critical loads for a higher latency during software pipelining. "Noncritical" denotes those loads that have s...
Sebastian Winkel, Rakesh Krishnaiyer, Robyn Sampso...
ISSAC
2007
Springer
177views Mathematics» more  ISSAC 2007»
13 years 11 months ago
Component-level parallelization of triangular decompositions
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...
Marc Moreno Maza, Yuzhen Xie