Rough Times Ahead

  title={Rough Times Ahead},
  author={Scott Kirkpatrick},
  pages={668 - 669}
Clusters of conventional computers have almost replaced vector-based supercomputers among the world9s 500 biggest computing complexes, thereby tapping a computing resource with lower costs. But as Kirkpatrick explains in his Perspective, this approach brings new problems. He highlights the report by Korniss et al ., who demonstrate that the simulations times of the different processors can diverge very quickly, leading to temporal "roughening." As a result, it can be difficult to synchronize… 
Translating network models to parallel hardware in NEURON
Small-World Synchronized Computing Networks for Scalable Parallel Discrete-Event Simulations
It is shown that when the synchroniza- tion topology is extended to include quenched random communication links between the processing elements, they make a close-to-uniform progress with a nonzero rate, without global synchronization.
Extreme fluctuations in noisy task-completion landscapes on scale-free networks.
This work presents large-scale simulation results using the exact algorithmic rules, supported by mean-field arguments based on a coarse-grained description, of extreme fluctuations in noisy task-completion landscapes, such as those emerging in synchronized distributed-computing networks, or generic causally constrained queuing networks, with scale-free topology.
Synchronization landscapes in small-world-connected computer networks.
A simple growth model on regular and small-world networks, embedded in one and two dimensions, finds that the synchronization landscape exhibits Kardar-Parisi-Zhang-like kinetic roughening on regular networks with short-range communication links.
Synchronization in Small-World-Connected Computer Networks
It is shown that when the synchronization topology is extended to include quenched random communication links (small-world links) between the processing elements, they make a close-to-uniform progress with a nonzero rate, without global synchronization.
Synchronization in Weighted Uncorrelated Complex Networks in a Noisy Environment: Optimization and Connections with Transport Efficiency
  • G. Korniss
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2007
It is found that in the mean-field approximation on uncorrelated scale-free graphs, synchronization is optimal at beta*= -1 and the naturally related problem of optimizing performance in queue-limited communication networks utilizing local weighted routing schemes is pursued.
Extreme fluctuations in small-world-coupled autonomous systems with relaxational dynamics
Synchronization is a fundamental problem in natural and artificial coupled multi-component systems. We investigate to what extent small-world couplings (extending the original local relaxational
Optimizing Synchronization, Flow, and Robustness in Weighted Complex Networks
This chapter investigates optimization in fundamental synchronization and flow problems where the weights are proportional to (k i k j )β with k i and k j being the degrees of the nodes connected by the edge.
Field Programmable Gate Array (FPGA): A Tool For Improving Parallel Computations
This research work explores the underlying parallel architecture of this Field Programmable Gate Array (FPGA) and the design methodology, the design tools for implementing FPGAs is discussed e.g. System Generator from Xilinx, Impulse C programming model etc.


Suppressing Roughness of Virtual Times in Parallel Discrete-Event Simulations
It is shown that weak random interactions among thePEs can make this spread nondivergent, and the PEs then progress at a nonzero, near-uniform rate without requiring global synchronizations.
The connection machine
The Connection Machine describes a fundamentally different kind of computer that Daniel Hillis and others are now developing to perform tasks that no conventional, sequential machine can solve in a reasonable time.
What's next in high-performance computing?
We can trace the evolution from Crays, to clusters, to supercomputing centers. But where does it go from here?
Dynamic scaling of growing interfaces.
A model is proposed for the evolution of the profile of a growing interface that exhibits nontrivial relaxation patterns, and the exact dynamic scaling form obtained for a one-dimensional interface is in excellent agreement with previous numerical simulations.
Peer-to-Peer: Harnessing the Power of Disruptive Technologies
Key peer-to-peer pioneers take us beyond the headlines and hype and show how the technology is changing the way the authors communicate and exchange information.
疟原虫var基因转换速率变化导致抗原变异[英]/Paul H, Robert P, Christodoulou Z, et al//Proc Natl Acad Sci U S A
Small World
Single molecule detection in solution : methods and applications
Obituary.List of Contributors.Single Molecule Detection in Liquids and on Surfaces under Ambient Conditions: Introduction and Historical Overview. Theoretical Foundations of Single Molecule Detection
Commun. ACM
  • Commun. ACM
  • 2002
Phys. Rev. Lett
  • Phys. Rev. Lett
  • 1995