Arrival of multicore systems has enforced a new scenario in computing, the parallel and distributed algorithms are fast replacing the older sequential algorithms, with many challenges of these techniques. The distributed algorithms provide distributed processing using distributed file systems and processing units, while network is modeled as minimum cost spanning tree. On the other hand, the parallel processing chooses different language platforms, data parallel vs. parallel programming, and GPUs. Processing units, memory elements and storage are connected through dynamic distributed networks in the form of spanning trees. The article presents foundational algorithms, analysis, and efficiency considerations.

翻译：多核系统的到来催生了计算领域的新格局，并行与分布式算法正迅速取代传统的串行算法，并伴随着这些技术带来的诸多挑战。分布式算法利用分布式文件系统和处理单元实现分布式处理，而网络被建模为最小代价生成树。另一方面，并行处理涉及不同的语言平台、数据并行与并行编程的对比，以及图形处理器（GPU）。处理单元、存储元件和存储器通过动态分布式网络以生成树的形式相互连接。本文介绍了基础算法、分析方法和效率考量。