Filters








20,350 Hits in 6.0 sec

An assumed partition algorithm for determining processor inter-communication

A.H. Baker, R.D. Falgout, U.M. Yang
2006 Parallel Computing  
A particular challenge for large-scale scientific software is determining the inter-processor communications required by the computation when a global description of the data is unavailable or too costly  ...  We present a type of rendezvous algorithm that determines communication partners in a scalable manner by assuming the global distribution of the data.  ...  Acknowledgments We appreciate the contribution of all of the hypre library developers, and we thank Barry Lee for his input regarding the structured-grid interface algorithm.  ... 
doi:10.1016/j.parco.2006.06.009 fatcat:66u54j7zfjfohhg7744jr7rbnm

Embedded Parallel Systems Based on Dynamic Look-Ahead Reconfiguration in Redundant Communication Resources

E. Laskowski, M. Tudruj
2006 9th EUROMICRO Conference on Digital System Design (DSD'06)  
The architecture assumes connection reconfiguration in multiple crossbar switches. Programs are structured into sections that use temporarily fixed inter-processor connections for communication.  ...  The structuring algorithm finds the partition into sections that minimizes the execution time of a program executed with the look-ahead created connections.  ...  An application program is partitioned into sections, which assume fixed direct inter-processor connections. Connections for next sections are prepared while current sections are executed.  ... 
doi:10.1109/dsd.2006.48 dblp:conf/dsd/LaskowskiT06 fatcat:binkdso4abez5di4wuwu2egvp4

Fast Scheduling and Partitioning Algorithm in the Multi-processor System with Redundant Communication Resources [chapter]

Eryk Laskowski
2002 Lecture Notes in Computer Science  
An application program is partitioned into sections, which are executed using redundant communication resources.  ...  Parallel program scheduling in such a kind of environment incorporates graph partitioning problem. The paper presents a scheduling algorithm for look-ahead reconfigurable multi-processor systems.  ...  - An application program is partitioned into sections which assume fixed direct inter-processor connections set in active communication resources.  ... 
doi:10.1007/3-540-48086-2_11 fatcat:fjjhwakuh5ellkpqzorl5nzbau

Optimal Task Partitioning Model in Distributed Heterogeneous Parallel Computing Environment

Javed Ali
2012 International Journal of Advanced Information Technology  
We target the algorithm for task partitioning which improve the inter process communication between the tasks and use the recourses of the system in the efficient manner.  ...  The proposed algorithm contributes the inter-process communication cost minimization amongst the executing processes.  ...  Algorithm used for the proposed model: An optimal algorithm for scheduling interval ordered tasks on m processor.  ... 
doi:10.5121/ijait.2012.2602 fatcat:fvlirr2ua5cxnbhgcpcvd7bosu

Slicing based code parallelization for minimizing inter-processor communication

Mahmut Kandemir, Yuanrui Zhang, Sai Prasanth Muralidhara, Ozcan Ozturk, Sri Hari Krishna Narayanan
2009 Proceedings of the 2009 international conference on Compilers, architecture, and synthesis for embedded systems - CASES '09  
One of the critical problems in distributed memory multicore architectures is scalable parallelization that minimizes inter-processor communication.  ...  The goal is to minimize inter-processor data communications. Based on this iteration space slicing based formulation of the problem, we also propose a solution scheme.  ...  Minimizing Inter-processor Communication Let us now consider a partitioning of elements of array An across P processors: X1,n, X2,n, · · · , X P,n .  ... 
doi:10.1145/1629395.1629409 dblp:conf/cases/KandemirZMON09 fatcat:nohgkf2mzrbjxcczc3jciifnrq

Designing Ideal Task Partitioning Scheduling Model In Distributed Computing Scenario

Maninderjit Singh Khanna
2017 International Journal Of Engineering And Computer Science  
The proposed algorithm improves inter process communication between tasks by using recourses of the system in an efficient manner.  ...  Some important models for task partitioning have also been discussed in this paper.  ...  THE PROPOSED ALGORITHM FOR INTER-PROCESS COMMUNICATION AMONGST TASKS: It's an optimal algorithm for scheduling interval ordered tasks on (m) processors.  ... 
doi:10.18535/ijecs/v6i11.22 fatcat:krkcf5sowjaxvmjya7idrynl6y

An efficient parallel implementation of explicit multirate Runge–Kutta schemes for discontinuous Galerkin computations

Bruno Seny, Jonathan Lambrechts, Thomas Toulorge, Vincent Legat, Jean-François Remacle
2014 Journal of Computational Physics  
Our implementation makes use of the MeTiS library for mesh partitioning and the Message Passing Interface for inter-processor communication.  ...  It tends to minimize the inter-processor communications, while ensuring that the workload is almost equally shared by every computer core at every stage of the algorithm.  ...  the Atmosphere and Ocean of the Isaac Newton Institute for Mathematical Sciences.  ... 
doi:10.1016/j.jcp.2013.07.041 fatcat:hcoljvvazja5fm2wr6zsbl2nwm

Compile-time partitioning and scheduling of parallel programs

Vivek Sarkar, John Hennessy
1986 SIGPLAN notices  
Multiprocessor performance is maximized when parallelism between tasks is optimally traded off with communication and synchronization overhead.  ...  We present compile-time partitioning and scheduling techniques to achieve this trade-Off.  ...  A list of target parameters (e.g. number of processors, communication overhead, inter-processor distances) drives the partitioning for a given multiprocessor architecture. Using a !  ... 
doi:10.1145/13310.13313 fatcat:74luodw6k5cmnb625wehbeg5su

Cluster partitioning approaches to mapping parallel programs onto a hypercube

P Sadayappan, F Ercal, J Ramanujam
1990 Parallel Computing  
The nearest-neighbor strategy is shown to be more e ective on hypercube systems with high communication start-up costs, especially for nite element graphs; the recursive partitioning heuristic is generally  ...  The task-to-processor mapping problem is addressed in the context of a local-memory multiprocessor with a hypercube interconnection topology.  ...  into account in determining the mapping with minimal total inter-processor communication volume.  ... 
doi:10.1016/0167-8191(90)90115-p fatcat:lpyqgwud3zhebaljyb2h6lk7tq

GloMoSim

Xiang Zeng, Rajive Bagrodia, Mario Gerla
1998 ACM SIGSIM Simulation Digest  
explicitly modeled), which dramatically increases inter-processor communication topology.  ...  Third, in PCS models, communication is limited within a cell except that mobility may cause inter-cell and hence, inter-processor communication in parallel execution.  ...  Special thanks to this paper's reviewers for their valuable comments and PARSEC group for implementation support.  ... 
doi:10.1145/278009.278027 fatcat:csi6uww7xjdj5o2vfk3dscwbme

Cluster-partitioning approaches to mapping parallel programs onto a hypercube [chapter]

P. Sadayappan, Fikret Ercal
1988 Lecture Notes in Computer Science  
The nearest-neighbor strategy is shown to be more e ective on hypercube systems with high communication start-up costs, especially for nite element graphs; the recursive partitioning heuristic is generally  ...  The task-to-processor mapping problem is addressed in the context of a local-memory multiprocessor with a hypercube interconnection topology.  ...  into account in determining the mapping with minimal total inter-processor communication volume.  ... 
doi:10.1007/3-540-18991-2_28 fatcat:2jr6y7ytrrhs5pcokgtbggecmu

Incremental compilation for parallel logic verification systems

R. Tessier, S. Jana
2002 IEEE Transactions on Very Large Scale Integration (vlsi) Systems  
Important aspects of this work include the formulation and analysis of two incremental design mapping steps: the partitioning of newly added design logic onto multiple logic processors and the communication  ...  scheduling of newly added design signals between logic processors.  ...  determine communication patterns between affected processors.  ... 
doi:10.1109/tvlsi.2002.801614 fatcat:r6l3cna55zbsvc2jcnrj7bhiju

Graph Matching Algorithm for Task Assignment Problem

R Mohan
2011 International Journal of Computer Science Engineering and Applications  
In this paper, we have parallelized the basic heuristic graph-matching algorithm of task assignment which is suitable only for cases where processors and inter processor links are homogeneous.  ...  An optimal task assignment guarantees minimum turnaround time for a given architecture.  ...  The methodology is especially effective in cases where all processors and inter processor communication links are identical.  ... 
doi:10.5121/ijcsea.2011.1609 fatcat:cld7xhzmvnhbzdh7amj2uwxnka

Grid-enabled parallel divide-and-conquer

Chun-Hsi Huang
2002 Proceedings of the 2002 ACM symposium on Applied computing - SAC '02  
The algorithm is communication-free in the conquer stage and uses only a small amount of messages while partitioning the input.  ...  These include a distributed-memory system: a Solaris cluster of 32 Sun Ultra5 computers on Myrinet network and a distributed shared-memory system: an SGI Origin 2000 with 32 R10000 processors, using MPICH-GM  ...  Therefore, designing an approach which reduces the inter-processor communication overhead while balancing the workload becomes essential.  ... 
doi:10.1145/508950.508959 fatcat:joioumnpwngwxi6hpf53g5buum

Grid-enabled parallel divide-and-conquer

Chun-Hsi Huang
2002 Proceedings of the 2002 ACM symposium on Applied computing - SAC '02  
The algorithm is communication-free in the conquer stage and uses only a small amount of messages while partitioning the input.  ...  These include a distributed-memory system: a Solaris cluster of 32 Sun Ultra5 computers on Myrinet network and a distributed shared-memory system: an SGI Origin 2000 with 32 R10000 processors, using MPICH-GM  ...  Therefore, designing an approach which reduces the inter-processor communication overhead while balancing the workload becomes essential.  ... 
doi:10.1145/508791.508959 dblp:conf/sac/Huang02 fatcat:cpogpktzfbbwxnqfwcsa3di4y4
« Previous Showing results 1 — 15 out of 20,350 results