Technic and Collaboration Breakdown Structures: Drivers of collaborative problem solving approaches in a supply chain context

Problem Solving Methodologies have been par excellence a cornerstone element of the firms’ strategy on achieving effective continuous improvement. But the enterprise evolution towards an extended environment characterized by network-based organization has radically changed the problem solving paradigms. This paper aims to propose a generic and collaborative methodology addressing more complex and distributed problems, dealing with Supply Chain issues and having a key role as a driver for building global competitive advantages and create superior performances at a Supply Chain level

Matrix Factorization at Scale: a Comparison of Scientific Data Analytics in Spark and C+MPI Using Three Case Studies

We explore the trade-offs of performing linear algebra using Apache Spark, compared to traditional C and MPI implementations on HPC platforms. Spark is designed for data analytics on cluster computing platforms with access to local disks and is optimized for data-parallel tasks. We examine three widely-used and important matrix factorizations: NMF (for physical plausability), PCA (for its ubiquity) and CX (for data interpretability). We apply these methods to TB-sized problems in particle physics, climate modeling and bioimaging. The data matrices are tall-and-skinny which enable the algorithms to map conveniently into Spark's data-parallel model. We perform scaling experiments on up to 1600 Cray XC40 nodes, describe the sources of slowdowns, and provide tuning guidance to obtain high performance

Distributed Integrated Circuits: An Alternative Approach to High-Frequency Design

Distributed integrated circuits are presented as a methodology to design high-frequency communication building blocks. Distributed circuits operate based on multiple parallel signal paths working in synchronization that can be used to enhance the frequency of operation, combine power, and enhance the robustness of the design. These multiple signal paths usually result in strong couplings inside the circuit that necessitate a treatment spanning architecture, circuits, devices, and electromagnetic levels of abstraction

Minimizing synchronizations in sparse iterative solvers for distributed supercomputers

Eliminating synchronizations is one of the important techniques related to minimizing communications for modern high performance computing. This paper discusses principles of reducing communications due to global synchronizations in sparse iterative solvers on distributed supercomputers. We demonstrates how to minimizing global synchronizations by rescheduling a typical Krylov subspace method. The benefit of minimizing synchronizations is shown in theoretical analysis and is verified by numerical experiments using up to 900 processors. The experiments also show the communication complexity for some structured sparse matrix vector multiplications and global communications in the underlying supercomputers are in the order P1/2.5 and P4/5 respectively, where P is the number of processors and the experiments were carried on a Dawning 5000A

Optimisation of patch distribution strategies for AMR applications

As core counts increase in the world's most powerful supercomputers, applications are becoming limited not only by computational power, but also by data availability. In the race to exascale, efficient and effective communication policies are key to achieving optimal application performance. Applications using adaptive mesh refinement (AMR) trade off communication for computational load balancing, to enable the focused computation of specific areas of interest. This class of application is particularly susceptible to the communication performance of the underlying architectures, and are inherently difficult to scale efficiently. In this paper we present a study of the effect of patch distribution strategies on the scalability of an AMR code. We demonstrate the significance of patch placement on communication overheads, and by balancing the computation and communication costs of patches, we develop a scheme to optimise performance of a specific, industry-strength, benchmark application

Comparing inductive and deductive methodologies for design patterns identification and articulation

Design patterns offer a valuable format to communicate knowledge of successful design solutions to recurring problems. However, there is a lack of research into design patterns that differentiate the applicability of the proposed design solutions across different nations. This paper discusses inductive and deductive methodologies for analyzing qualitative data in order to identify and articulate design patterns for cross-cultural computer-supported collaborative design learning. It proposes a methodology how patterns for facilitating intercultural design education can be identified and articulated. Within this research, an inductive, deductive and comparative methodology for identifying and articulating design patterns was developed. Therein, eleven patterns for intercultural computer-supported collaboration were identified and written. This paper introduces the proposed methodology taking the design pattern “MOOD OF THE MOMENT” for example