9,050 Hits in 6.5 sec

A Compositional Approach to Synchronize Two Dimensional Networks of Processors

Salvatore La Torre, Margherita Napoli, Mimmo Parente
2000 RAIRO - Theoretical Informatics and Applications  
The problem of synchronizing a network of identical processors that work synchronously at discrete steps is studied.  ...  Algorithms are given to synchronize in time n 2 , ndlog ne, nd p n e and 2 n a square array of (n n) processors.  ...  Introduction We consider the problem of synchronizing a network of identical processors that work synchronously at discrete steps. Processors are arranged as an array of m rows and n columns.  ... 
doi:10.1051/ita:2000130 fatcat:7yukqxrrzbhtdhj74hr5r3d654

Performance issues of a distributed frame buffer on a multicomputer

Bin Wei, Douglas W. Clark, Edward W. Felten, Kai Li, Gordon Stoll
1998 Proceedings of the ACM SIGGRAPH/EUROGRAPHICS workshop on Graphics hardware - HWWS '98  
from multiple processors to a frame buffer.  ...  This architectural approach can also effectively support image composition for sort-last.  ...  Acknowledgments We would like to thank Patrick Hanrahan for his initiation of the project, Tom Crockett of ICASE for providing the PGL source code and suggestions for modification, Cezary Dubnicki and  ... 
doi:10.1145/285305.285316 fatcat:ejmhdviofveifedn2lsfmq6t3i

Different time solutions for the firing squad synchronization problem on basic grid networks

Jozef Gruska, Salvatore La Torre, Margherita Napoli, Mimmo Parente
2006 RAIRO - Theoretical Informatics and Applications  
We present several solutions to the Firing Squad Synchronization Problem on grid networks of different shapes.  ...  We first present synchronization algorithms that work in time n 2 , n log n, n √ n, 2 n , where n is a total number of processors.  ...  This is to thank to anonymous referees for their valuable comments and suggestions  ... 
doi:10.1051/ita:2006002 fatcat:gocylq3lnrfhlbtn22ggexuqre

Various Solutions to the Firing Squad Synchronization Problems [article]

J. Gruska, S. La Torre, M. Napoli, M. Parente
2005 arXiv   pre-print
We present different classes of solutions to the Firing Squad Synchronization Problem on networks of different shapes. The nodes are finite state processors that work at unison discrete steps.  ...  We are given a particular time expressed as a function of the number of nodes of the network, $f(n)$ and present synchronization algorithms in time $n^2$, $n \log n$, $n\sqrt n$, $2^n$.  ...  Finally, we give a construction to "inherit" synchronizations on two-dimensional networks starting from synchronizations of the corresponding linear networks.  ... 
arXiv:cs/0511044v1 fatcat:vt3x2gszvvbfxisako56pddps4

Dynamic Load Partitioning Strategies for Managing Data of Space and Time Heterogeneity in Parallel SAMR Applications [chapter]

Xiaolin Li, Manish Parashar
2003 Lecture Notes in Computer Science  
This paper presents the design and experimental evaluation of two dynamic load partitioning and balancing strategies for parallel Structured Adaptive Mesh Refinement (SAMR) applications: the Level-based  ...  An experimental evaluation of the partitioning schemes is also presented.  ...  Consider partitioning a one dimensional grid hierarchy with two refinement levels, as shown in Figure 3 . For this 1-D example, GPA partitions the composite grid unit list into two subdomains.  ... 
doi:10.1007/978-3-540-45209-6_27 fatcat:aj4gftotdnfjldqpaf5odhgsa4

Neural Network Implementation Approaches for the Connection Machine

Nathan H. Brown Jr.
1987 Neural Information Processing Systems  
Mappings are constructed to defme higher dimensional interconnectivity between processors on top of the fundamental geometry of the communication network.  ...  The first approach, "the edge list approach," distributes the edge list of a network graph to the eM, one edge per CM processor.  ... 
dblp:conf/nips/Brown87 fatcat:p4s66sdvnjcu7pxs26djiaih7u

Parallel sphere rendering

Michael Krogh, James Painter, Charles Hansen
1997 Parallel Computing  
The T3D nodes (2 Alpha processors comprise a node) are organized into a torus network via 300 MB/s links. The torus is then connected to the YMP through two 200 MB/s high speed links.  ...  Cornpositing After all P processors have rendered their spheres, they synchronize and the P images are composited.  ... 
doi:10.1016/s0167-8191(97)00038-0 fatcat:7uh6rarmtza2ncuehwkdruztii

The frame synchronization mechanism for the multi-rendering surrounding display environment

Jiung-yao Huang, Kuei Min Wang, Kuan-Wen Hsu
2004 Displays (Guildford)  
Furthermore, we implemented the frame synchronization algorithm in both hardware and software approaches to investigate the necessity of a special hardware for the multiple host parallel rendering environment  ...  Our experiments showed that the hardware approach can achieve more accurate frame synchronizing effect but the software approach provides better flexibility in building such a system. q  ...  Acknowledgements The work is the extension of the research supported by National Science Council, Taiwan, at the contract number 90-2213-E-032-015.  ... 
doi:10.1016/j.displa.2004.07.003 fatcat:m2rmn6mrijeihhtgpzqmne2eii

SBASCO: skeleton-based scientific components

M. Diaz, B. Rubio, E. Soler, J.M. Troya
2004 12th Euromicro Conference on Parallel, Distributed and Network-Based Processing, 2004. Proceedings.  
This paper presents the system programming model, which considers two different views of a component interface: one from the point of view of the application programmer and another thought to be used by  ...  This can be achieved due to the knowledge at the interface level of data distribution and processor layout inside each component.  ...  two-dimensional arrays.  ... 
doi:10.1109/empdp.2004.1271461 dblp:conf/pdp/DiazRST04 fatcat:hhd2k43ksrfwllkvf2zxbktyye

A parallel cellular automata implementation on a transputer network for the simulation of small scale fluid flow experiments [chapter]

J. A. Somers, P. C. Rem
1989 Lecture Notes in Computer Science  
The cellular automata technique has proven to be useful for direct simulation of fluid flow experiments in both two and three dimensions.  ...  We will present a method to impose boundary conditions on complex geometries, consistently with the microscopic behaviour of a cellular automaton.  ...  An SIMD machine executes highly synchronously a regular parallel composition of idententical components.  ... 
doi:10.1007/3-540-51604-2_8 fatcat:4gj4clxh3jdbjfgvzd3jraasqi

Using SBASCO to Solve Reaction-Diffusion Equations in Two-Dimensional Irregular Domains [chapter]

Manuel Díaz, Sergio Romero, Bartolomé Rubio, Enrique Soler, José M. Troya
2006 Lecture Notes in Computer Science  
Specifically, we present a scientific application to study the propagation of reaction waves in two-dimensional irregular domains which can be divided into overlapping rectangular regions.  ...  Domain decomposition techniques are used to solve a system of two non-linear reaction-diffusion equations.  ...  Two-dimensional domains that exhibit an irregular geometry with re-entrant corners are considered.  ... 
doi:10.1007/11758525_121 fatcat:r2psr3ln6jcjbm5mvkx6snmrsu

Interactive rendering of volumetric data sets

Scott Juskiw, Nelson G. Durdle, V.James Raso, Doug L. Hill
1995 Computers & graphics  
The proposed architecture is scalable and uses custom processors to achieve high-speed shading, projection. and composition of voxel primitives.  ...  A general purpose image composition network supports the accumulation of both volumetric and geometric elements into the final rendered scene.  ...  a distributed network of dedicated processors [4.13,17J.  ... 
doi:10.1016/0097-8493(95)00047-x fatcat:fh5i3dqxc5erfgt7ik4tom23x4

Hierarchical Partitioning Techniques for Structured Adaptive Mesh Refinement Applications

Xiaolin Li, Manish Parashar
2004 Journal of Supercomputing  
The overall goal of these techniques is to enable the load distribution to reflect the state of the adaptive grid hierarchy and exploit it to reduce synchronization requirements, improve load-balance,  ...  The hierarchical partitioning algorithm (HPA) partitions the computational domain into subdomains and assigns them to hierarchical processor groups. Two variants of HPA are presented in this paper.  ...  This scheme uses space filling curves (SFC) [14] , which are a class of locality preserving recursive mappings from n-dimensional space to 1-dimensional space.  ... 
doi:10.1023/b:supe.0000022099.81839.a3 fatcat:albfcs24q5dppkj6hmn767ff5a

Page 3558 of Mathematical Reviews Vol. , Issue 2002E [page]

2002 Mathematical Reviews  
approach to synchronize two dimensional networks of processors.  ...  Summary: “The problem of synchronizing a network of identi- cal processors that work synchronously at discrete steps is studied.  ... 

Predictable dynamic embedded data processing

Marc Geilen, Sander Stuijk, Twan Basten
2012 2012 International Conference on Embedded Computer Systems (SAMOS)  
A formal, compositional model is used to exploit Pareto-optimal trade-offs in the system use.  ...  To preserve efficient development of such systems, dynamism needs to be taken into account as a primary concern, not as a verification or tuning effort after the design is done.  ...  The approach is compositional and incremental.  ... 
doi:10.1109/samos.2012.6404194 dblp:conf/samos/GeilenSB12 fatcat:oskdckwjujexxhj5dyraehmuqa
« Previous Showing results 1 — 15 out of 9,050 results