A Partitioning Strategy for Nonuniform Problems on Multiprocessors
IEEE Transactions on Computers
A parallel graph partitioning algorithm for a message-passing multiprocessor
International Journal of Parallel Programming
A new heuristic for partitioning the nodes of a graph
SIAM Journal on Discrete Mathematics
Partitioning sparse matrices with eigenvectors of graphs
SIAM Journal on Matrix Analysis and Applications
Performance of dynamic load balancing algorithms for unstructured mesh calculations
Concurrency: Practice and Experience
An improved spectral graph partitioning algorithm for mapping parallel computations
SIAM Journal on Scientific Computing
Recent directions in netlist partitioning: a survey
Integration, the VLSI Journal
New faster Kernighan-Lin-type graph-partitioning algorithms
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Hierarchical partitioning algorithm for optimistic distributed simulation of DEVS models
Journal of Systems Architecture: the EUROMICRO Journal - Special double issue: parallel and distributed simulation
A performance evaluation of hyper text transfer protocols
SIGMETRICS '99 Proceedings of the 1999 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
SIAM Journal on Scientific Computing
Difficulties in simulating the internet
IEEE/ACM Transactions on Networking (TON)
Theory of Modeling and Simulation
Theory of Modeling and Simulation
Genetic Algorithm and Graph Partitioning
IEEE Transactions on Computers
Request Redirection Algorithms for Distributed Web Systems
IEEE Transactions on Parallel and Distributed Systems
A linear-time heuristic for improving network partitions
DAC '82 Proceedings of the 19th Design Automation Conference
Graph Partitioning Algorithms with Applications to Scientific Computing
Graph Partitioning Algorithms with Applications to Scientific Computing
Cost-based partitioning for distributed simulation of hierarchical modular devs models
Cost-based partitioning for distributed simulation of hierarchical modular devs models
An Effective Multilevel Algorithm for Bisecting Graphs and Hypergraphs
IEEE Transactions on Computers
Discrete event multi-level models for systems biology
Transactions on Computational Systems Biology I
Graph partitioning using annealed neural networks
IEEE Transactions on Neural Networks
A workload characterization study of the 1998 World Cup Web site
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.00 |
We present a concise, generic, and configurable partitioning approach for decomposable, modular, and multiscale (or hierarchical) constructive models. A generic model partitioning (GMP) algorithm decomposes a given multiscale model to a set of partition blocks based on a cost modeling and analysis method in polynomial time. It minimizes model decompositions and constructs monotonically improved partitioning outcomes during the partitioning process. The cost modeling and analysis method enables translating subjective, domain-specific, and heterogeneous resource information to objective, domain-independent, and homogeneous cost information. By translating models to a homogeneous cost space and describing partitioning logics over the space, the proposed algorithm utilizes domain-specific knowledge to produce the best partitioning results without any modification of its programming logics. As a consequence of its clean separation between domain-specific partitioning requirements and goals, and generic partitioning logic, the proposed algorithm can be applied to a variety of partitioning problems in large-scale systems biology research utilizing distributed and parallel simulation. It is expected that the algorithm improves overall performance and efficiency of in silico experimentation of complex multiscale biological system models.