Efficient parallel algorithms for doubly convex-bipartite graphs
Theoretical Computer Science
Optimization of array redistribution for distributed memory multicomputers
Parallel Computing
Processor Mapping Techniques Toward Efficient Data Redistribution
IEEE Transactions on Parallel and Distributed Systems
Optimizations for efficient array redistribution on distributed memory multicomputers
Journal of Parallel and Distributed Computing - Special issue on compilation techniques for distributed memory systems
Fast runtime block cyclic data redistribution on multiprocessors
Journal of Parallel and Distributed Computing
Scheduling Block-Cyclic Array Redistribution
IEEE Transactions on Parallel and Distributed Systems
Algorithmic Redistribution Methods for Block-Cyclic Decompositions
IEEE Transactions on Parallel and Distributed Systems
Efficient Algorithms for Block-Cyclic Array Redistribution Between Processor Sets
IEEE Transactions on Parallel and Distributed Systems
A Generalized Basic-Cycle Calculation Method for Efficient Array Redistribution
IEEE Transactions on Parallel and Distributed Systems
Contention-free communication scheduling for array redistribution
Parallel Computing
On the complexity of the maximum biplanar subgraph problem
Information Sciences—Informatics and Computer Science: An International Journal
Processor reordering algorithms toward efficient GEN_BLOCK redistribution
Proceedings of the 2001 ACM symposium on Applied computing
A Generalized Processor Mapping Technique for Array Redistribution
IEEE Transactions on Parallel and Distributed Systems
A Framework for Efficient Data Redistribution on Distributed Memory Multicomputers
The Journal of Supercomputing
Sparse Matrix Block-Cyclic Redistribution
IPPS '99/SPDP '99 Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing
Multi-phase array redistribution: modeling and evaluation
IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
Symbolic Communication Set Generation for Irregular Parallel Applications
The Journal of Supercomputing
Buffer minimization using max-coloring
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A Divide-and-Conquer Algorithm for Irregular Redistribution in Parallelizing Compilers
The Journal of Supercomputing
Graph Theory With Applications
Graph Theory With Applications
Journal of Computer and System Sciences
An efficient algorithm for irregular redistributions in parallelizing compilers
ISPA'03 Proceedings of the 2003 international conference on Parallel and distributed processing and applications
Approximation algorithms for the max-coloring problem
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Irregular redistribution scheduling by partitioning messages
ACSAC'05 Proceedings of the 10th Asia-Pacific conference on Advances in Computer Systems Architecture
A Two-Level Scheduling Strategy for optimising communications of data parallel programs in clusters
International Journal of Ad Hoc and Ubiquitous Computing
| Hi-index | 0.00 |
The max-edge-coloring problem (MECP) is finding an edge colorings {E1, E2, E3, .., Ez} of a weighted graph G=(V, E) to minimize Σi=1z max {w(ek)|ek ∈Ei}, where w(ek) is the weight of ek. In the work, we discuss the complexity issues on the MECP and its variants. Specifically, we design a 2-approximmation algorithm for the max-edge-coloring problem on biplanar graphs, which is bipartite and has a biplanar drawing. Next, we show the splitting chromatic max-edge-coloring problem, a variant of MECP, is NP-complete even when the input graph is restricted to biplanar graphs. Finally, we also show that these two problems have applications in scheduling data redistribution on parallel computer systems.