Parallel Computing Technologies

The development and the usage of parallel computing systems make it necessary to research parallelization resource of algorithms for search of the most rapid implementation. The algorithm representation as Q-determinant is one of the approaches that can be applied for that case. Such representation allows getting the most rapid possible implementation of the algorithm evaluates its performance complexity. Our work is to develop software system QStudio, which presents algorithm in the form of Q-determinant using the flowchart, finds the most rapid implementation of that one and builds an execution plan. The obtained results are oriented to ideal model of parallel computer system. However they can be a basis for automated execution of the most rapid algorithm implementations for real parallel computing systems.

[1]  A. Grabowskia,et al.  Ising-based model of opinion formation in a complex network of interpersonal interactions , 2006 .

[2]  Gerardo Iñiguez,et al.  Modelling opinion formation driven communities in social networks , 2010, Comput. Phys. Commun..

[3]  Patrick Suppes,et al.  Learning Pattern Recognition Through Quasi-Synchronization of Phase Oscillators , 2011, IEEE Transactions on Neural Networks.

[4]  DeLiang Wang,et al.  Image Segmentation Based on Oscillatory Correlation , 1997, Neural Computation.

[5]  DeLiang Wang,et al.  Locally excitatory globally inhibitory oscillator networks , 1995, IEEE Transactions on Neural Networks.

[6]  Robert J. Glass,et al.  The Role of Community Structure in Opinion Cluster Formation , 2012, Complex.

[7]  Ezequiel V Albano,et al.  Dynamic behavior of a social model for opinion formation. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[8]  P. Clifford,et al.  A model for spatial conflict , 1973 .

[9]  Norbert Sendra,et al.  Sznajd Model with Memory , 2014, ACRI.

[10]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[11]  S. Galam.  Minority opinion spreading in random geometry , 2002, cond-mat/0203553.

[12]  Tomasz M. Gwizdalla,et al.  The Dynamics of Disproportionality Index for Cellular Automata Based Sociophysical Models , 2012, ACRI.

[13]  B. Schmittmann,et al.  Opinion formation on adaptive networks with intensive average degree. , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

[14]  Yoshio Tanaka,et al.  An Advance Reservation-Based Co-allocation Algorithm for Distributed Computers and Network Bandwidth on QoS-Guaranteed Grids , 2010, JSSPP.

[15]  Sebastian Schnettler,et al.  A structured overview of 50 years of small-world research , 2009, Soc. Networks.

[16]  Jun Shi,et al.  Image Segmentation with Simplified PCNN , 2009, 2009 2nd International Congress on Image and Signal Processing.

[17]  George N. Rouskas,et al.  Resource co-allocation for large-scale distributed environments , 2009, HPDC '09.

[18]  Licheng Jiao,et al.  Extracting hierarchical organization of complex networks by dynamics towards synchronization , 2009 .

[19]  Katarzyna Sznajd-Weron,et al.  Opinion evolution in closed community , 2000, cond-mat/0101130.

[20]  Stefan Bornholdt,et al.  Opinion formation model for markets with a social temperature and fear , 2012, Physical review. E, Statistical, nonlinear, and soft matter physics.

[21]  Dietrich Stauffer,et al.  GENERALIZATION TO SQUARE LATTICE OF SZNAJD SOCIOPHYSICS MODEL , 2000 .

[22]  Mark D. McDonnell,et al.  Effect of network topology in opinion formation models , 2009, CARE 2009.

[23]  Guillaume Bouchard,et al.  Opinion Formation in the Social Web: Agent-Based Simulations of Opinion Convergence and Divergence , 2011, ADMI.

[24]  Muthucumaru Maheswaran,et al.  A Synchronous Co-Allocation Mechanism for Grid Computing Systems , 2004, Cluster Computing.