Sciweavers

158 search results - page 14 / 32
» Benefits of Processor Clustering in Designing Large Parallel...
Sort
View
LCPC
2001
Springer
14 years 1 months ago
A Comparative Evaluation of Parallel Garbage Collector Implementations
While uniprocessor garbage collection is relatively well understood, experience with collectors for large multiprocessor servers is limited and it is unknown which techniques best ...
C. Richard Attanasio, David F. Bacon, Anthony Cocc...
SIGMETRICS
2010
ACM
212views Hardware» more  SIGMETRICS 2010»
14 years 1 months ago
A mean field model of work stealing in large-scale systems
In this paper, we consider a generic model of computational grids, seen as several clusters of homogeneous processors. In such systems, a key issue when designing efficient job al...
Nicolas Gast, Bruno Gaujal
COMSWARE
2007
IEEE
14 years 3 months ago
A Parallelization of ECDSA Resistant to Simple Power Analysis Attacks
The Elliptic Curve Digital Signature Algorithm admits a natural parallelization wherein the point multiplication step can be split in two parts and executed in parallel. Further pa...
Sarang Aravamuthan, Viswanatha Rao Thumparthy
SIGMETRICS
2002
ACM
105views Hardware» more  SIGMETRICS 2002»
13 years 8 months ago
Modeling and analysis of dynamic coscheduling in parallel and distributed environments
Scheduling in large-scale parallel systems has been and continues to be an important and challenging research problem. Several key factors, including the increasing use of off-the...
Mark S. Squillante, Yanyong Zhang, Anand Sivasubra...
EUROPAR
2005
Springer
14 years 2 months ago
Hierarchical Scheduling for Moldable Tasks
The model of moldable task (MT) was introduced some years ago and has been proved to be an efficient way for implementing parallel applications. It considers a target application ...
Pierre-François Dutot