Search

Every year, the International Symposium on Computer Architecture (ISCA) recognizes the most influential paper published in the conference 15 years earlier, based on its impact on research, development, products, or ideas. [ABSTRACT FROM AUTHOR]

In this paper we present User Customizable Logic Paper (UCLP) with a Sea-of Transmission-Gates (SOTG) of 2-V organic CMOS transistors. This can enable users to fabricate custom integrated circuits, by printing 200 \mu\ m wide interconnects with at-home ink-jet printers for the prototyping of large-area electronics and educational purposes. The SOTG reduces the area of the circuits in UCLP by between 11% and 85% compared with a conventional gate array architecture. [ABSTRACT FROM AUTHOR]

While graphics remain central to the mission of the article titled "NVIDIA A100 Tensor Core GPU: Performance and Innovation", GPUs have becomethedefaultforhighperformanceandprogrammability in one solution, supporting a huge variety of scientific computing workloads and powering both neuralnetworktrainingandinference. GUESTEDITORS'INTRODUCTION BestPapersFromHotChips32 Priyanka Raina,StanfordUniversity,Stanford,CA,94305,USA CliffYoung,Google,PaloAlto,CA,94306,USA W elcome toour specialissue of IEEE Micro, which highlights the best presentations from Hot Chips 32, held virtually on August 16-18, 2020. Bridging between the general-purpose floatingpoint power of GPUs and the specialized application focus of neural network accelerators, "Manticore: A 4096-Core RISC-V Chiplet Architecture for Ultraefficient Floating-Point Computing" uses the extensibility of the RISC-V ISA to reduce control overheads and energycostsforneural-networkworkloads. [Extracted from the article]

This column discusses the MICRO Test of Time Award, given to the most influential papers published in past MICRO conferences. The authors discuss the selection process for 2014 and the future, solicit nominations for 2015, and announce the 2014 award winners. [ABSTRACT FROM PUBLISHER]

While working with usual software tools users have to change their many valued logical thinking (approximate reasoning) into the two-valued computer logic. Although the Structured Query Language (SQL) is a very powerful tool, it is unable to satisfy needs for data selection based on linguistic expressions and degrees of truth. In this paper, we are interested in flexible querying that is based on fuzzy set theory. Medina et al. have developed a server named fuzzy SQL, supporting flexible queries and based on a theoretic model called GEFRED. To model the flexible queries and the concept of fuzzy attributes, an extension of the SQL language named fuzzy SQL has been defined. The FRDB supposed has already been defined by the user. In this paper, we extend the work of medina et al. to implement a new architecture of fuzzy DBMS based on the GEFRED model. This architecture is based on the concept of weak coupling with the DBMS SQL Server. [ABSTRACT FROM AUTHOR]

In this paper we present the current version of the Parallelized Large-Eddy Simulation Model (PALM) whose core has been developed at the Institute of Meteorology and Climatology at Leibniz Universität Hannover (Germany). PALM is a Fortran 95-based code with some Fortran 2003 extensions and has been applied for the simulation of a variety of atmospheric and oceanic boundary layers for more than 15 years. PALM is optimized for use on massively parallel computer architectures and was recently ported to general-purpose graphics processing units. In the present paper we give a detailed description of the current version of the model and its features, such as an embedded Lagrangian cloud model and the possibility to use Cartesian topography. Moreover, we discuss recent model developments and future perspectives for LES applications. [ABSTRACT FROM AUTHOR]

This column discusses the winner of the 2012 International Symposium on Computer Architecture Influential Paper Award. It describes, from the point of view of the chair of the committee, what makes the paper influential. [ABSTRACT FROM PUBLISHER]

This paper considers sparse device activity detection for cellular machine-type communications with non-orthogonal signatures using the approximate message passing algorithm. This paper compares two network architectures, massive multiple-input-multiple-output (MIMO) and cooperative MIMO, in terms of their effectiveness in overcoming inter-cell interference. In the massive MIMO architecture, each base station (BS) detects only the users from its own cell while treating inter-cell interference as noise. In the cooperative MIMO architecture, each BS detects the users from neighboring cells as well; the detection results are then forwarded in the form of a log-likelihood ratio (LLR) to a central unit where final decisions are made. This paper analytically characterizes the probabilities of false alarm and missed detection for both architectures. The numerical results validate the analytic characterization and show that as the number of antennas increases, a massive MIMO system effectively drives the detection error to zero, while as the cooperation size increases, the cooperative MIMO architecture mainly improves the cell-edge user performance. Moreover, this paper studies the effect of LLR quantization to account for the finite-capacity fronthaul. The numerical simulations of a practical scenario suggest that in specific case cooperating three BSs in a cooperative MIMO system achieves about the same cell-edge detection reliability as a non-cooperative massive MIMO system with four times the number of antennas per BS. [ABSTRACT FROM AUTHOR]

A. Kireeva et al. contributed another paper in the field of cellular automata: "Parallel simulation of drift-diffusion-recombination by cellular automata and global random walk algorithm". Parallel computing technologies enable the solution of large-scale numerical simulation and data processing problems in science and industry. The previously proposed contention-aware scheduling algorithm is formally described with this model, modifications of the algorithm are proposed: look-ahead technique, chunked data transfers, data caching, and peer-to-peer data transfers. [Extracted from the article]

Parallel computing has become a crucial topic in the concern of computer science and also it is revealed to be critical when researching in high performance. The evolution of computer architectures towards an improved number of nodes, where parallelism could be the approach to option for speeding up an algorithm within the last few decades. The combination of processing units build a model of computation (circuits) has gained an essential place in the area of high performance computing (HPC) due to its configuration and considerable processing supremacy that is parallel, series, etc.... In this paper, we study the idea of parallel computing, and its programming models and also explore some theoretical and technical concepts which can be often needed to understand the Interconnection network. In particular, we show how this technology is new in assisting the field of computational physics, especially when the issue is data parallel. In this paper firstly we convert the graphical model of perfect difference network into circuit diagram then convert circuit diagram into switching function, then simplify it and redraw the equivalent network. [ABSTRACT FROM AUTHOR]

This column discusses an award given in 2013: the 2013 SIGARCH/TCCA Influential ISCA Paper Award, given to the authors of the paper "Pipeline Gating: Speculation Control for Energy Reduction." [ABSTRACT FROM PUBLISHER]

Prospective authors are requested to submit new, unpublished manuscripts for inclusion in the upcoming event described in this call for papers. [ABSTRACT FROM AUTHOR]

The papers in this special section focus on softwarized networking for next generation industrial cyber-physical systems (CPSs). With the emergence of embedded and ubiquitous cyberphysical applications, the rationale of blending the physical and the virtual worlds has become ever promising. These papers examine several topics that are recently concerned in the community, including the software defined architectures and implementations, advanced machine learning and data analytics solutions, blockchain-based network services and applications, network function allocation, dependable and trustable solutions, energy efficient networks and services, and other enabling technologies for integrating softwarized networks into CPSs. [ABSTRACT FROM AUTHOR]

The article introduces a new section structure for the SIAM Journal on Scientific Computing (SISC), including a focus on Scientific Machine Learning as a major development in the field of scientific computing. Topics include the development of accurate, efficient, and scalable machine learning algorithms for solving mathematical modeling problems, emphasizing the importance of reproducibility in the review process.

This special issue is a result of the enthusiastic response to the initiation of a new industry paper track at the 2020 International Symposium on Computer Architecture, as we could not accept all the great submissions to that track.1 We are excited to share our interest in commercial products with many industry colleagues who answered our call for papers. [ABSTRACT FROM AUTHOR]

This introduction to the special issue presents the 2014 top picks in computer architecture, along with 12 "honorable mention" papers. [ABSTRACT FROM PUBLISHER]

Network slicing is the key to enable virtualized resource sharing among vertical industries in the era of 5G communication. Efficient resource allocation is of vital importance to realize network slicing in real-world business scenarios. To deal with the high algorithm complexity, privacy leakage, and unrealistic offline setting of current network slicing algorithms, in this paper we propose a fully decentralized and low-complexity online algorithm, DPoS, for multi-resource slicing. We first formulate the problem as a global social welfare maximization problem. Next, we design the online algorithm DPoS based on the primal-dual approach and posted price mechanism. In DPoS, each tenant is incentivized to make its own decision based on its true preferences without disclosing any private information to the mobile virtual network operator and other tenants. We provide a rigorous theoretical analysis to show that DPoS has the optimal competitive ratio when the cost function of each resource is linear. Extensive simulation experiments are conducted to evaluate the performance of DPoS. The results show that DPoS can not only achieve close-to-offline-optimal performance, but also have low algorithmic overheads. [ABSTRACT FROM AUTHOR]

The current article discusses Sierpinski networks, which are fractal networks with certain applications in computer science, physics, and chemistry. These networks are typically used in complicated frameworks, fractals, and recursive assemblages. The results derived in this study are in mathematical and graphical format for particular classes of these networks of two distinct sorts with two invariants, K-Banhatti Sombor (KBSO) and Dharwad, along with their reduced forms. These results can facilitate the formation, scalability, and introduction of novel interconnection network topologies, chemical compounds, and VLSI processor circuits. The mathematical expressions employed in this research offer modeling insights and design guidelines to computer engineers. The derived simulation results demonstrate the optimal ranges for a certain network. The optimization assistant tool deployed in this work provides a single maximized value representing the maximum optimized network. These ranges can be put into service to dynamically establish a network according to the requirements of this paper. [ABSTRACT FROM AUTHOR]

This paper aims to propose innovative actions of advanced technological solutions and consequent necessary institutional decisions to achieve in a reasonable time the definitive confidential data protection and data sovereignty, based on available scientific results. Confidential data protection is a fundamental and strategic issue in next-generation Internet systems to guarantee data sovereignty and the respect of human rights as stated in the foundation of the United Nations. Even if presently many international regulations are decisive steps to guarantee data protection within normative contexts, they are not adequate to face new technologies, such as facial recognition, automatic profiling, position tracking, biometric data, AI applications, and many others in the future, as they are implemented without any awareness by the interested subjects. Therefore, a new approach to data protection is mandatory based on innovative and disruptive technological solutions. A recent OECD report highlighted the need for the so-called Privacy-Enhancing Technologies (PETs) for the effective protection of confidential data, even more urgent for the coexistence of privacy and data sharing in international contexts. A common feature of these technologies is the use of software methodologies that can run on currently available microprocessors and their present immaturity. More effective and definitive protection can be achieved with another methodological approach based on the paradigm of 'Data Usage Control'. This new concept guarantees data protection policy by default and initial design and it requires a new architecture of the data and a new HW&SW architecture of the computers. This contribution has a two-fold objective: first, to clarify why regulations alone and present technological proposals are not adequate for the effective and definitive protection of data and, second, to indicate the new necessary technological approach and the simultaneous institutional actions required to achieve the definitive protection and sovereignty of data in reasonable times, based on the results already available in the scientific literature. [ABSTRACT FROM AUTHOR]

Self-supervised learning has shown value for uncovering informative movement features for human activity recognition. However, there has been minimal exploration of this approach for affect recognition where availability of large labelled datasets is particularly limited. In this paper, we propose a P-STEMR (Parallel Space-Time Encoding Movement Representation) architecture with the aim of addressing this gap and specifically leveraging the higher availability of human activity recognition datasets for pain-level classification. We evaluated and analyzed the architecture using three different datasets across four sets of experiments. We found statistically significant increase in average F1 score to 0.84 for pain level classification with two classes based on the architecture compared with the use of hand-crafted features. This suggests that it is capable of learning movement representations and transferring these from activity recognition based on data captured in lab settings to classification of pain levels with messier real-world data. We further found that the efficacy of transfer between datasets can be undermined by dissimilarities in population groups due to impairments that affect movement behaviour and in motion primitives (e.g. rotation versus flexion). Future work should investigate how the effect of these differences could be minimized so that data from healthy people can be more valuable for transfer learning. [ABSTRACT FROM AUTHOR]

In today's digital landscape, organizations face significant challenges, including sensitive data leaks and the proliferation of hate speech, both of which can lead to severe consequences such as financial losses, reputational damage, and psychological impacts on employees. This work considers a comprehensive solution using a microservices architecture to monitor computer usage within organizations effectively. The approach incorporates spyware techniques to capture data from employee computers and a web application for alert management. The system detects data leaks, suspicious behaviors, and hate speech through efficient data capture and predictive modeling. Therefore, this paper presents a comparative performance analysis between Spring Boot and Quarkus, focusing on objective metrics and quantitative statistics. By utilizing recognized tools and benchmarks in the computer science community, the study provides an in-depth understanding of the performance differences between these two platforms. The implementation of Quarkus over Spring Boot demonstrated substantial improvements: memory usage was reduced by up to 80% and CPU usage by 95%, and system uptime decreased by 119%. This solution offers a robust framework for enhancing organizational security and mitigating potential threats through proactive monitoring and predictive analysis while also guiding developers and software architects in making informed technological choices. [ABSTRACT FROM AUTHOR]

The problem of resource-saving scheduling in a fog environment is considered in this paper. The objective function of the problem in question presupposes the fog nodes' reliability function maximizing. Therefore, to create a schedule, the following is required: the history of the fog devices' state changes and the search space, which consists of preselected nodes of the cloud-fog broker neighbourhood. The obvious approach to providing the scheduler with this information is to poll the fog nodes, yet this can consume the unacceptable time because of the QoS requirements. In this paper, the system architecture and general methods for efficient resource-saving scheduling is presented. The system is based on distributed ledger element usage, which provides the nodes with the proper awareness about the surroundings. The usage of the distributed ledger allows not only for the creation of the resource-saving schedule but also the reduction of the scheduling problem-solving time, which frees addition time that can be used for the solving of user tasks. The latter also affects the overall resource-saving via reliability. The novelty of this paper consists in the development of the hybrid ledger-based system, which integrates and arranges the elements of various ledger types to solve the newly formulated problem. [ABSTRACT FROM AUTHOR]

Recently, convolutional neural networks (CNNs) have achieved great success in the field of artificial intelligence, including speech recognition, image recognition, and natural language processing. CNN architecture plays a key role in CNNs' performance. Most previous CNN architectures are hand-crafted, which requires designers to have rich expert domain knowledge. The trial-and-error process consumes a lot of time and computing resources. To solve this problem, researchers proposed the neural architecture search, which searches CNN architecture automatically, to satisfy different requirements. However, the blindness of the search strategy causes a 'loss of experience' in the early stage of the search process, and ultimately affects the results of the later stage. In this paper, we propose a self-adaptive mutation neural architecture search algorithm based on ResNet blocks and DenseNet blocks. The self-adaptive mutation strategy makes the algorithm adaptively adjust the mutation strategies during the evolution process to achieve better exploration. In addition, the whole search process is fully automatic, and users do not need expert knowledge about CNNs architecture design. In this paper, the proposed algorithm is compared with 17 state-of-the-art algorithms, including manually designed CNN and automatic search algorithms on CIFAR10 and CIFAR100. The results indicate that the proposed algorithm outperforms the competitors in terms of classification performance and consumes fewer computing resources. [ABSTRACT FROM AUTHOR]

Introduces papers featured in the 2005 issue of "Personal & Ubiquitous Computing" and which were presented at the 17th International Conference on the Architecture of Computing Systems in 2004 in Augsburg, Germany. Focus on organic and pervasive computing; Biennial series of German conferences on the architecture of computing systems; System aspects of organic and pervasive computing in software and hardware; System integration and self-management of hardware, software, and networking.