Sciweavers

1205 search results - page 102 / 241
» On P Systems with Bounded Parallelism
Sort
View
154
Voted
ANSS
1991
IEEE
15 years 7 months ago
Supercritical speedup
The notions of the critical path of events and critical time of an event are key concepts in analyzing the performance of a parallel discrete event simulation. The highest critica...
David R. Jefferson, Peter L. Reiher
ISPASS
2009
IEEE
15 years 10 months ago
Machine learning based online performance prediction for runtime parallelization and task scheduling
—With the emerging many-core paradigm, parallel programming must extend beyond its traditional realm of scientific applications. Converting existing sequential applications as w...
Jiangtian Li, Xiaosong Ma, Karan Singh, Martin Sch...
157
Voted
PVG
2003
IEEE
212views Visualization» more  PVG 2003»
15 years 9 months ago
SLIC: Scheduled Linear Image Compositing for Parallel Volume Rendering
Parallel volume rendering offers a feasible solution to the large data visualization problem by distributing both the data and rendering calculations among multiple computers con...
Aleksander Stompel, Kwan-Liu Ma, Eric B. Lum, Jame...
HPCA
2009
IEEE
16 years 4 months ago
Fast complete memory consistency verification
The verification of an execution against memory consistency is known to be NP-hard. This paper proposes a novel fast memory consistency verification method by identifying a new na...
Yunji Chen, Yi Lv, Weiwu Hu, Tianshi Chen, Haihua ...
154
Voted
COCO
2010
Springer
186views Algorithms» more  COCO 2010»
15 years 7 months ago
Derandomized Parallel Repetition of Structured PCPs
A PCP is a proof system for NP in which the proof can be checked by a probabilistic verifier. The verifier is only allowed to read a very small portion of the proof, and in return ...
Irit Dinur, Or Meir