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.
In mixed-criticality (MC) systems, multiple activities with various certification requirements (thus with different criticality levels) can co-exist on shared hardware platforms, where multicore processors have emerged as the de facto computing engines. In this paper, by using the partitioned earliest-deadline-first with virtual deadlines (EDF-VDs) scheduler for a set of periodic MC tasks running...
We show that the perfect matching problem in general graphs is in Quasi-NC. That is, we give a deterministic parallel algorithm which runs in O(\log^3 n) time on n^{O(\log^2 n)} processors. The result is obtained by a derandomization of the Isolation Lemma for perfect matchings, which was introduced in the classic paper by Mulmuley, Vazirani and Vazirani [1987] to obtain a Randomized NC algorithm...
Flash-based SSDs have been extensively deployed in modern storage systems to satisfy the increasing demand of storage performance and energy efficiency. However, Garbage Collection (GC) is an important performance concern for flash-based SSDs, because it tends to disrupt the normal operations of an SSD. This problem continues to plague flash-based storage systems, particularly in the high performance...
The (s+t+1)-dimensional exchanged crossed cube (ECQ(s, t) for short), combines the advantage of the exchanged hypercube and the crossed cube. The Hamiltonicity connectivity is an important property in interconnection networks. In this paper, firstly, we prove that there exists not only a Hamiltonian path but also less than 1 than Hamiltonian path between any two distinct vertices in ECQ(s, t), where...
We propose a new complexity class to characterize the efficiently parallelizable parameterized problems called fixed-parameter parallel-tractable (FPPT). Although FPPT = FPP and they can be transformed one another, FPPT is much simpler and reasonable than FPP. The viewpoint of FPPT allows us to concentrate on important intrinsic issues, such as to understand the contribution of each parameter to transfer...
Energy harvesting is replacing battery to power embedded systems such as Internet of Things and wearable devices. Unstable energy supply brings challenges to energy harvesting powered system, resulting in frequent interruptions. Non-volatile processor is proposed to back up volatile logics before energy depletion and recover the system status after energy resumes. The backup efficiency of memory content...
In embedded SoC applications, the demand for integration of heterogeneous processors on a single chip is increasing. On-chip heterogeneity allows different processors to employ different cache coherence protocols which in turn add difficulties in the task of integrating different coherence protocols as well as realizing the task of coherence verification. This work first proposes an efficient mechanism...
Technology needs to be eco-friendly most importantly microchips need to be redesigned and manufactured in an eco-friendly manner since they are the heart of all technology. With a look to the future its not hard for one to conclude that silicon will meet its fate. Wise men said the best time to plant a tree was 20 years ago and the second best time is now. Silicon microchips have been the primary...
Nowadays, multiprocessing is mainstream with exponentially increasing number of processors. Load balancing is, therefore, a critical operation for the efficient execution of parallel algorithms. In this paper we consider the fundamental class of tree-based algorithms that are notoriously irregular,, hard to load-balance with existing static techniques. We propose a hybrid load balancing method using...
Boolean matrix multiplication (BMM) is a fundamental problem with applications in graph theory, group testing, data compression, and digital signal processing (DSP). The search for efficient BMM algorithms has produced several fast, albeit impractical, algorithms with sub-cubic time complexity. In this paper, we propose a memristor-crossbar framework for computing BMM at the hardware level in linear...
In mixed-criticality systems functionalities of different criticalities, that need to have their correctness validated to different levels of assurance, co-exist upon a shared platform. Multiple specifications at differing levels of assurance may be provided for such systems; the specifications that are trusted at very high levels of assurance tend to be more conservative than those at lower levels...
The growth of the smart-phone market has been phenomenal. I don't need to quote exact numbers, which are in the hundreds of millions, to illustrate their ubiquity -- most of us have a smart-phone in our pocket. The design constraints on smart phones are among the most challenging in computing: 1) low power to preserve battery life; 2) base-band processors to support 4G data rates (100 Mbs -- moving...
A problem of identification of faulty processors of a multiprocessor system is investigated. A method to reduce a pattern of a global syndrome for multiprocessor system which has a 4-cube topology, for the MM model, is presented. Results of the method for some topologies are also presented.
This paper considers the feasibility of applying low-power, energy-efficient hardware to the problem of password cracking. Low-power hardware may be usefully applied to security problems in applications where speed is not critical, but devices must be deployed discreetly and may be powered by energy-harvesting (e.g. long term surveillance). A proof of concept implementation is described and the performance...
Major goal in designing multicomputer networks is to include fault tolerance capability so that the system can continue to operate correctly after losing some of its basic components. This is usually achieved by introducing redundancy, i.e., Adding spare processors and links to the network. However, due to the limitation on the number of links adjacent to a node in VLSI design, it is important to...
We discuss a parallel Lepp-bisection algorithm for two-dimensional mesh refinement over distributed memory systems. We discuss the subdivision of the mesh and the management of interface refinement and communication. We also study the empirical algorithm behavior.
In this paper, we discuss and prove properties of the Johnson scheme G(n, k), with vertex set all subsets of {1, 2, …, n}, and (x, y) is an edge whenever |x Π y| = k − 1. We proved that it is Hamiltonian by constructing an algorithm that will generate a Hamiltonian cycle given n and k. We also proved that there is an embedding from the Johnson scheme to a subgraph of the hypercube. We also proved...
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.