Sciweavers

ISAAC
1995
Springer
135views Algorithms» more  ISAAC 1995»
15 years 8 months ago
The I/O - Complexity of Ordered Binary - Decision Diagram Manipulation
Ordered Binary-Decision Diagrams (OBDD) are the state-of-the-art data structure for boolean function manipulation and there exist several software packages for OBDD manipulation. ...
Lars Arge
IRREGULAR
1995
Springer
15 years 8 months ago
Run-Time Parallelization of Irregular DOACROSS Loops
Dependencies between iterations of loop structures cannot always be determined at compile-time because they may depend on input data which is known only at run-time. A prime examp...
V. Prasad Krothapalli, Thulasiraman Jeyaraman, Mar...
IRREGULAR
1995
Springer
15 years 8 months ago
Parallel Search for Combinatorial Optimization: Genetic Algorithms, Simulated Annealing, Tabu Search and GRASP
In this paper, we review parallel search techniques for approximating the global optimal solution of combinatorial optimization problems. Recent developments on parallel implementa...
Panos M. Pardalos, Leonidas S. Pitsoulis, Thelma D...
IRREGULAR
1995
Springer
15 years 8 months ago
Run-Time Techniques for Parallelizing Sparse Matrix Problems
Sparse matrix problems are di cult to parallelize e ciently on message-passing machines, since they access data through multiple levels of indirection. Inspector executor strategie...
Manuel Ujaldon, Shamik D. Sharma, Joel H. Saltz, E...
RTAS
1997
IEEE
15 years 8 months ago
RT-CRM: Real-Time Channel-based Reflective Memory
In this paper, we propose and present Real-Time Channel-based Reflective Memory (RT-CRM)
Chia Shen, Ichiro Mizunuma