Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Modeling and simulation of parallel adaptive divide-and-conquer algorithms

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

Conventional modeling and simulation formalisms only give support to the representation of model behavior, providing no constructs for describing changes in model structure. However, some systems are better modeled by self-reconfigurable formalisms. We have developed the Discrete Flow System Specification (DFSS) to exploit dynamic structure, component-based and hierarchical model construction. Due to structural similarity, dynamic self-configuring DFSS models offer a good description of systems, like adaptive algorithms and reconfigurable computer architectures. In this paper, we present the modeling and simulation of a parallel adaptive divide-and-conquer integration algorithm in the CaosTalk modeling and simulation framework, a realization of the DFSS formalism.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Barros FJ (1997) Modeling formalisms for dynamic structure systems. ACM Trans Modeling Comput Simul 7(4):501–515

    Article  MATH  MathSciNet  Google Scholar 

  2. Barros FJ (2002) Modeling and simulation of dynamic structure heterogeneous flow systems. SIMULATION: Trans Soc Model Simul Int 78(1):18–27

    Article  MATH  Google Scholar 

  3. Compton K, Hauck S (2002) Reconfigurable computing: a survey of systems and software. ACM Comput Surv 34(2):171–210

    Article  Google Scholar 

  4. Johnston WE (2002) Computational and data grids in large-scale science and engineering. Futur Gener Comput Syst 18:1085–1100

    Article  MATH  Google Scholar 

  5. Kartachev SP, Kartachev SI (1987) Analysis and synthesis of dynamic multicomputer networks that reconfigures into rings, trees and stars. IEEE Trans Comput 36(7):823–844

    Article  Google Scholar 

  6. Kumaran S, Quinn MJ (1995) Divide-and-conquer programming on MIMD computers. In: Proceedings of the 9th international parallel processing symposium, pp 734–741

  7. Lim A (2001) Distributed services for information dissemination in self-organizing sensor networks. J Franklin Inst 338:707–727

    Article  MATH  Google Scholar 

  8. Mei B, Lambrechts A, Mignolet JY, Verkest D, Lauwereins R (2005) Arquitecture exploration for a reconfigurable architecture template. IEEE Des Test Comput 2:90–101

    Google Scholar 

  9. Ravasz E, Somera AL, Mongru DA, Oltvai ZN, Barabási A-L (2002) Hierarchical organization of modularity in metabolic networks. Science 297:1551–1555

    Article  Google Scholar 

  10. Ralston A, Rabinowitz P (1978) A first course in numerical analysis. Dover, New York

    MATH  Google Scholar 

  11. Srinivas S (1992) Design and analysis of a generalized architecture for reconfigurable m-ary tree structures. IEEE Trans Comput 41(11):1456–1478

    Article  MathSciNet  Google Scholar 

  12. Wang IY (1986) Simulation of a modular hierarchical adaptive computer architecture with communication delay. MS thesis, Department of Electrical and Computer Engineering, University of Arizona

  13. Yao X (1999) Evolving artificial neural networks. Proc IEEE 87(9):1423–1447

    Article  Google Scholar 

  14. Zeigler BP (1990) Object-oriented simulation with hierarchical, modular models: intelligent agents and endomorphic systems. Academic, New York

    MATH  Google Scholar 

  15. Zhou S (1988) A trace-driven simulation study of dynamic load balancing. IEEE Trans Softw Eng 14(8):1327–1341

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Fernando J. Barros.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Barros, F.J. Modeling and simulation of parallel adaptive divide-and-conquer algorithms. J Supercomput 43, 241–255 (2008). https://doi.org/10.1007/s11227-007-0143-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-007-0143-3

Keywords