The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Recent advances in the development of commercial quantum annealers such as the D-Wave 2X allow solving NP-hard optimization problems that can be expressed as quadratic unconstrained binary programs. However, the relatively small number of available qubits (around 1000 for the D-Wave 2X quantum annealer) poses a severe limitation to the range of problems that can be solved. This paper explores the...
Redesigning the large and complex software systems requires very high costs time and money. Hence, automatic management and automatic adaptability with minimal human intervention is unavoidable. Self-management is the greatest level of self-adaptive which include all self-adaptive details. Scalability and dynamic analysis support in the face of change are the main challenges of self-management. Due...
Today's usable quantum computers, variously known as adiabatic quantum computers or quantum annealers and exemplified by the D-Wave 2X™ system, have an instruction set architecture foreign to mainstream classical computers and thus require a new class of programming tools to enable their widespread use. We submit that well-chosen abstractions, each balancing the ability of high- and low-level tools...
Heterogeneous computing has recently emerged as a way to circumvent the physical and technological limitations in the design of computing devices. The pressure exerted by the ever-growing demand of increased performances has eventually made the long-awaited dream of having a traditional CPU paired up with an FPGA a reality [1], [2]. FPGAs have proven indeed to be a viable solution for energy efficient...
Dataflow computing is proved to be promising in high-performance computing. However, traditional dataflow architectures are general-purpose and not efficient enough when dealing with typical scientific applications due to low utilization of function units. In this paper, we propose an optimization of dataflow architectures for scientific applications. The optimization introduces a request for operands...
As the benefits of CMOS feature size scaling (Moore and Dennard) are coming to an end, there is an emerging need to re-architect computing systems from the ground up. Will quantum and neuro-inspired computers outperform conventional architectures? Will heterogeneous system architectures become mainstream? What will future memories look like? In this evening session, a group of experts will share their...
Resistive memories have gained high research attention for enabling design of in-memory computing circuits and systems. We propose for the first time an automatic compilation methodology suited to a recently proposed computer architecture solely based on resistive memory arrays. Our approach uses Majority-Inverter Graphs (MIGs) to manage the computational operations. In order to obtain a performance...
Quantum annealing device has shown a great potential in solving discrete problems that are theoretically and empirically hard. Boolean Satisfiability (SAT) problem, determining if there is an assignment of variables that satisfies a given Boolean function, is the first proven NP-complete problem widely used in various domains. Here, we present a novel mapping of the SAT problem to the quadratic unconstrained...
We present and analyze a hybrid computational architecture for performing multi-agent optimization. The optimization problems under consideration have convex objective and constraint functions with mild smoothness conditions imposed on them. For such problems, we provide a primal-dual algorithm implemented in the hybrid architecture, which consists of a decentralized network of agents into which an...
Designed with the goal of mimicking key features of real HPC workloads, mini-apps have become an important tool for co-design. An investigation of mini-app behavior can provide system designers with insight into the impact of architectures, programming models, and tools on application performance. Mini-apps can also serve as a platform for fast algorithm design space exploration, allowing the application...
Provides an abstract for each of the plenary presentations and a brief professional biography of each presenter. The complete presentations were not made available for publication as part of the conference proceedings.
One of the main problems of current system design and architecture tools is the communication between the tool and the user and vice-versa. The tools are too opaque, and the users often don't understand their outputs, which results in loss of confidence in the tool. The users are also frustrated because they don't have an effective way of providing their expert knowledge (acquired either in real time...
Large aerospace organizations typically spend significant resources in optimizing system design by means of specialized software (e.g., computer-aided design, simulation). Conversely, architectural decisions are made much faster, with far less resources, and typically, in a much less structured way. This is despite clear indications that architectural decisions fix many design decisions, and have...
Stencil computation is a performance critical kernel used in scientific and engineering applications. We define a term of locality of computation to guide stencil optimization by either architecture or compiler. Being analogous to locality of reference, computational behavior is also classified into spatial locality and temporal locality. This paper develops equivalent computation elimination (ECE)...
Dense matrix-matrix multiplication algorithm is widely used in large scientific applications, and often it is an important factor of the overall performance of the application. Therefore, optimizing this algorithm, both for parallel and serial execution would give an overall performance boost. In this paper we overview the most used dense matrix multiplication optimization techniques applicable for...
Quantum algorithms can be written down in several forms, one of the most common is the quantum circuit representation using discrete gates. The challenge in assessing the computational cost then becomes counting those gates, with realistic costs assigned to each gate. Moreover, interacting pairs of qubits inside most quantum computers will require moving qubits. In many architectures, this will involve...
We seek to enable efficient large-scale parallel execution of applications in which a shared filesystem abstraction is used to couple many tasks. Such parallel scripting (many-task computing, MTC) applications suffer poor performance and utilization on large parallel computers because of the volume of filesystem I/O and a lack of appropriate optimizations in the shared filesystem. Thus, we design...
Multiplication is one of the most studied implementations in computing. Some architectures implement it as a single operation, while some others implement it as a combination of other operations. A typical implementation is the repeated addition method, where the operands are repeatedly added to get the result. Here, we try to modify this implementation by using the barrel shifter. The barrel shifter...
As the relationship between knowledge management and e-learning becomes closer and closer and the rapid development of the technology related with Computer Supported Collaborative Learning (CSCL), an appropriate kind of knowledge management mechanism supporting overall e-learning lifecycle process is needed to improve the effectiveness and efficiency of e-learning. Therefore, an SADT-based e-learning...
GPUs are more and more used as low cost high performance computing platforms. While new parallel computing architectures and languages such as OpenCL and CUDA, as well as some new libraries ease up their programming, it is still relatively difficult to design code for them in an efficient way and it gives us a taste of what pioneers experimented in the 50's when programming the first computers. Also...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.