Sciweavers

740 search results - page 2 / 148
» Recursive layout generation
Sort
View
ACSC
2003
IEEE
13 years 10 months ago
Force-Transfer: A New Approach to Removing Overlapping Nodes in Graph Layout
Graphs where each node includes an amount of text are often used in applications. A typical example of such graphs is UML diagrams used in CASE tools. To make text information in ...
Xiaodi Huang, Wei Lai
TPDS
2002
94views more  TPDS 2002»
13 years 4 months ago
Recursive Array Layouts and Fast Matrix Multiplication
The performance of both serial and parallel implementations of matrix multiplication is highly sensitive to memory system behavior. False sharing and cache conflicts cause traditi...
Siddhartha Chatterjee, Alvin R. Lebeck, Praveen K....
ASPDAC
2005
ACM
111views Hardware» more  ASPDAC 2005»
13 years 10 months ago
Fast floorplanning by look-ahead enabled recursive bipartitioning
A new paradigm is introduced for floorplanning any combination of fixed-shape and variable-shape blocks under tight fixedoutline area constraints and a wirelength objective. Dra...
Jason Cong, Michail Romesis, Joseph R. Shinnerl
SPAA
1999
ACM
13 years 9 months ago
Recursive Array Layouts and Fast Parallel Matrix Multiplication
Matrix multiplication is an important kernel in linear algebra algorithms, and the performance of both serial and parallel implementations is highly dependent on the memory system...
Siddhartha Chatterjee, Alvin R. Lebeck, Praveen K....
CLUSTER
2003
IEEE
13 years 10 months ago
Distributed Recursive Sets: Programmability and Effectiveness for Data Intensive Applications
This paper presents a concurrent object model based on distributed recursive sets for data intensive applications that use complex, recursive data layouts. The set abstraction is ...
Roxana Diaconescu, Reidar Conradi