1534 search results - page 246 / 307 » Stochastic Bounds on Execution Times of Parallel Computation... |
PPAM
2007
Springer
14 years 3 months ago
2007
Springer
Nowadays, capturing the knowledge in ontological structures is one of the primary focuses of the semantic web research. To exploit the knowledge from the vast quantity of existing ...
WSC
1998
13 years 10 months ago
1998
Simulation is widely used for performance analysis of Personal Communication Systems due to their inherent complexity. However, resource demands (cpu-time and memory requirements)...
CCGRID
2005
IEEE
14 years 2 months ago
2005
IEEE
Before an application modelled as a Directed Acyclic Graph (DAG) is executed on a heterogeneous system, a DAG mapping policy is often enacted. After mapping, the tasks (in the DAG...
CORR
2002
Springer
13 years 8 months ago
2002
Springer
An algorithm M is described that solves any well-defined problem p as quickly as the fastest algorithm computing a solution to p, save for a factor of 5 and loworder additive term...
ICPP
2007
IEEE
14 years 3 months ago
2007
IEEE
Ever-increasing memory footprint of applications and increasing mainstream popularity of shared memory parallel computing motivate us to explore memory compression potential in di...