# IEEE Transactions on Computers

## Filter Results

Displaying Results 1 - 24 of 24
• ### An fptas for Response Time Analysis of Fixed Priority Real-Time Tasks with Resource Augmentation

Publication Year: 2015, Page(s):1805 - 1818
Cited by:  Papers (4)
| |PDF (911 KB) | HTML

Response time analysis is required both for on-line admission of applications in dynamic systems and as an integral part of design tools for complex distributed real-time systems. We consider sporadic tasks with fixed-priorities and arbitrary deadlines to be executed upon a uniprocessor platform. Pseudo-polynomial time algorithms are known for computing exact worst-case response times for this tas... View full abstract»

• ### An Improved Stochastic Modeling of Opportunistic Routing in Vehicular CPS

Publication Year: 2015, Page(s):1819 - 1829
Cited by:  Papers (2)
| |PDF (892 KB) | HTML

Vehicular Cyber-Physical System (VCPS) provides CPS services via exploring the sensing, computing and communication capabilities on vehicles. VCPS is deeply influenced by the performance of the underlying vehicular network with intermittent connections, which make existing routing solutions hardly to be applied directly. Epidemic routing, especially the one using random linear network coding, has ... View full abstract»

• ### CCLS: An Efficient Local Search Algorithm for Weighted Maximum Satisfiability

Publication Year: 2015, Page(s):1830 - 1843
Cited by:  Papers (13)
| |PDF (278 KB) | HTML

The maximum satisfiability (MAX-SAT) problem, especially the weighted version, has extensive applications. Weighted MAX-SAT instances encoded from real-world applications may be very large, which calls for efficient approximate methods, mainly stochastic local search (SLS) ones. However, few works exist on SLS algorithms for weighted MAX-SAT. In this paper, we propose a new heuristic called CCM fo... View full abstract»

• ### Collaborative Location-Based Sleep Scheduling for Wireless Sensor Networks Integratedwith Mobile Cloud Computing

Publication Year: 2015, Page(s):1844 - 1856
Cited by:  Papers (30)
| |PDF (916 KB) | HTML

Recently, much research has proposed to integrate mobile cloud computing (MCC) with wireless sensor networks (WSNs) so that powerful cloud computing can be exploited to process the data gathered by ubiquitous WSNs and share the results with mobile users. However, all current MCC-WSN integration schemes ignore the following two observations: 1) the specific data mobile users request usually depend ... View full abstract»

• ### Community-Based Event Dissemination with Optimal Load Balancing

Publication Year: 2015, Page(s):1857 - 1869
Cited by:  Papers (6)
| |PDF (1027 KB) | HTML

Distributed publish/subscribe systems are poised with challenges of performance degradation and poor scalability. This is typically caused by an uneven load distribution of real-world applications and the susceptibility of link failure in networks. Partitioning and replication techniques have been implemented by exploring community-based load balancing to cope with such issues. The novel approach ... View full abstract»

• ### Data Collection Maximization in Renewable Sensor Networks via Time-Slot Scheduling

Publication Year: 2015, Page(s):1870 - 1883
Cited by:  Papers (15)
| |PDF (871 KB) | HTML

In this paper we study data collection in an energy renewable sensor network for scenarios such as traffic monitoring on busy highways, where sensors are deployed along a predefined path (the highway) and a mobile sink travels along the path to collect data from one-hop sensors periodically. As sensors are powered by renewable energy sources, time-varying characteristics of ambient energy sources ... View full abstract»

• ### Design of Hybrid Second-Level Caches

Publication Year: 2015, Page(s):1884 - 1897
Cited by:  Papers (5)
| |PDF (1603 KB) | HTML

In recent years, embedded dynamic random-access memory (eDRAM) technology has been implemented in last-level caches due to its low leakage energy consumption and high density. However, the fact that eDRAM presents slower access time than static RAM (SRAM) technology has prevented its inclusion in higher levels of the cache hierarchy. This paper proposes to mingle SRAM and eDRAM banks within the da... View full abstract»

• ### Enabling Concurrent Failure Recovery for Regenerating-Coding-Based Storage Systems: From Theory to Practice

Publication Year: 2015, Page(s):1898 - 1911
Cited by:  Papers (7)
| |PDF (1117 KB) | HTML Media

Data availability is critical in distributed storage systems, especially when node failures are prevalent in real life. A key requirement is to minimize the amount of data transferred among nodes when recovering the lost or unavailable data of failed nodes. This paper explores recovery solutions based on regenerating codes, which have been designed to provide fault-tolerant storage and minimum ban... View full abstract»

• ### Exploring Server Redundancy in Nonblocking Multicast Data Center Networks

Publication Year: 2015, Page(s):1912 - 1926
Cited by:  Papers (3)
| |PDF (813 KB) | HTML

Clos networks and their variations such as folded-Clos networks (fat-trees) have been widely adopted as network topologies in data center networks. Since multicast is an essential communication pattern in many cloud services, nonblocking multicast communication can ensure the high performance of such services. However, nonblocking multicast Clos networks are costly due to the large number of middl... View full abstract»

• ### Filter Data Cache: An Energy-Efficient Small L0 Data Cache Architecture Driven byMiss Cost Reduction

Publication Year: 2015, Page(s):1927 - 1939
Cited by:  Papers (3)
| |PDF (1879 KB) | HTML

On-chip cache memories play an important role in resource-constrained embedded systems by filtering out most off-chip memory accesses. Because cache latency and energy consumption are generally proportional to cache sizes, a small cache at the top level of the memory hierarchy is desirable. Previous work has presented a novel cache architecture called a filter cache to reduce hit time and energy c... View full abstract»

• ### Interleaving in Systolic-Arrays: A Throughput Breakthrough

Publication Year: 2015, Page(s):1940 - 1953
Cited by:  Papers (3)
| |PDF (1210 KB) | HTML

In past years the most common way to improve computers performance was to increase the clock frequency. In recent years this approach suffered the limits of technology scaling, therefore computers architectures are shifting toward the direction of parallel computing to further improve circuits performance. Not only GPU based architectures are spreading in consideration, but also Systolic Arrays ar... View full abstract»

• ### Lattice-Based Signatures: Optimization and Implementation on Reconfigurable Hardware

Publication Year: 2015, Page(s):1954 - 1967
Cited by:  Papers (4)
| |PDF (760 KB) | HTML

Nearly all of the currently used signature schemes, such as RSA or DSA, are based either on the factoring assumption or the presumed intractability of the discrete logarithm problem. As a consequence, the appearance of quantum computers or algorithmic advances on these problems may lead to the unpleasant situation that a large number of today's schemes will most likely need to be replaced with mor... View full abstract»

• ### Local Area Prediction-Based Mobile Target Tracking in Wireless Sensor Networks

Publication Year: 2015, Page(s):1968 - 1982
Cited by:  Papers (44)
| |PDF (1358 KB) | HTML Media

Tracking mobile targets in wireless sensor networks (WSNs) has many important applications. As it is often the case in prior work that the quality of tracking (QoT) heavily depends on high accuracy in localization or distance estimation, which is never perfect in practice. These bring a cumulative effect on tracking, e.g., target missing. Recovering from the effect and also frequent interactions b... View full abstract»

• ### Local-Deadline Assignment for Distributed Real-Time Systems

Publication Year: 2015, Page(s):1983 - 1997
Cited by:  Papers (4)
| |PDF (809 KB) | HTML Media

In a distributed real-time system (DRTS), jobs are often executed on a number of processors and must complete by their end-to-end deadlines. Job deadline requirements may be violated if resource competition among different jobs on a given processor is not considered. This paper introduces a distributed, locally optimal algorithm to assign local deadlines to the jobs on each processor without any r... View full abstract»

• ### Mining Associated Patterns from Wireless Sensor Networks

Publication Year: 2015, Page(s):1998 - 2011
Cited by:  Papers (8)
| |PDF (1349 KB) | HTML

Mining of sensor data for useful knowledge extraction is a very challenging task. Existing works generate sensor association rules using occurrence frequency of patterns to extract the knowledge. These techniques often generate huge number of rules, most of which are non-informative or fail to reflect true correlation among sensor data. In this paper, we propose a new type of behavioral pattern ca... View full abstract»

• ### Multiplicative Division Employing Independent Factors

Publication Year: 2015, Page(s):2012 - 2019
Cited by:  Papers (1)
| |PDF (324 KB) | HTML

We introduce a division procedure where a normalized quotient approximation is derived as a product of four independent closed form factors. Specific derivations of the method for IEEE-754 standard binary single and double precision division are developed in detail. Theoretical error bounds are derived to prove correctness for obtaining properly rounded single precision quotients by rounding the p... View full abstract»

• ### New Hardware Implementationsof WG$\bf {(29,11)}$ and WG- $\bf {16}$ StreamCiphers Using Polynomial Basis

Publication Year: 2015, Page(s):2020 - 2035
Cited by:  Papers (1)
| |PDF (2751 KB) | HTML

The WG stream ciphers are based on the WG (Welch-Gong) transformation and possess proved randomness properties. In this paper we propose nine new hardware designs for the two classes of WG(29,11) and WG-16. For each class, we design and implement three versions of standard, pipelined and serial. For the first time, we use the polynomial basis (PB) representation to design and implement the WG(29,1... View full abstract»

• ### Optimal Checkpoint Selection with Dual-Modular Redundancy Hardening

Publication Year: 2015, Page(s):2036 - 2048
| |PDF (1050 KB) | HTML

With the continuous scaling of semiconductor technology, failure rate is increasing significantly so that reliability becomes an important issue in multiprocessor system-on-chip (MPSoC) design. We propose an optimal checkpoint selection with task duplication hardening to tolerate transient faults. A target application is specified in a task graph, and the schedule/checkpoint placements are determi... View full abstract»

• ### Optimal Task Placement with QoS Constraints in Geo-Distributed Data Centers Using DVFS

Publication Year: 2015, Page(s):2049 - 2059
Cited by:  Papers (11)
| |PDF (931 KB) | HTML

With the rising demands on cloud services, the electricity consumption has been increasing drastically as the main operational expenditure (OPEX) to data center providers. The geographical heterogeneity of electricity prices motivates us to study the task placement problem over geo-distributed data centers. We exploit the dynamic frequency scaling technique and formulate an optimization problem th... View full abstract»

• ### Parallel Reproducible Summation

Publication Year: 2015, Page(s):2060 - 2070
Cited by:  Papers (13)
| |PDF (506 KB) | HTML

Reproducibility, i.e. getting bitwise identical floating point results from multiple runs of the same program, is a property that many users depend on either for debugging or correctness checking in many codes [10]. However, the combination of dynamic scheduling of parallel computing resources, and floating point nonassociativity, makes attaining reproducibility a challenge even for simple reducti... View full abstract»

• ### STAR: Strategy-Proof Double Auctions for Multi-Cloud, Multi-Tenant Bandwidth Reservation

Publication Year: 2015, Page(s):2071 - 2083
Cited by:  Papers (13)
| |PDF (742 KB) | HTML

Bandwidth reservation has been recognized as a value-added service to the cloud provider in recent years. We consider an open market of cloud bandwidth reservation, in which cloud providers offer bandwidth reservation services to cloud tenants, especially online streaming service providers, who have strict requirements on the amount of bandwidth to guarantee their quality of services. In this pape... View full abstract»

• ### Methodology for Cycle-Accurate DRAM Performance Analysis

Publication Year: 2015, Page(s):2084 - 2091
| |PDF (684 KB) | HTML

A new methodology for DRAM performance analysis has been proposed based on accurate characterization of DRAM bus cycles. The proposed methodology allows cycle-accurate performance analysis of arbitrary DRAM traces, obviates the need for functional simulations, allows accurate estimation of DRAM performance maximum, and enables root causing of suboptimal DRAM operation. View full abstract»

• ### Non-Binary Orthogonal Latin Square Codes for a Multilevel Phase Charge Memory (PCM)

Publication Year: 2015, Page(s):2092 - 2097
Cited by:  Papers (5)
| |PDF (564 KB) | HTML

This manuscript proposes non-binary orthogonal Latin square (OLS) codes that are amenable to a multilevel phase change memory (PCM). This is based on the property that the proposed (n symbols, ksymbols) t-symbol error correcting code uses the same H matrix as an (n bits, kbits) binary t-bit error correcting OLS code. The new codes are shown to have a shorter check bit length and better probability... View full abstract»

• ### On Compact Cauchy Matrices for Substitution-Permutation Networks

Publication Year: 2015, Page(s):2098 - 2102
Cited by:  Papers (2)
| |PDF (134 KB) | HTML

Maximum distance separable (MDS) matrices are widely used in the design of block ciphers. However, it is highly nontrival to find MDS matrices which could be used in practice. This paper focuses on the design of efficient MDS matrices for substitution-permutation networks (SPNs). We provide a new method to construct and count these MDS matrices. Moreover, we identified an interesting class of Cauc... View full abstract»

## Aims & Scope

The IEEE Transactions on Computers is a monthly publication with a wide distribution to researchers, developers, technical managers, and educators in the computer field.

Full Aims & Scope

## Meet Our Editors

Editor-in-Chief
Paolo Montuschi
Politecnico di Torino
Dipartimento di Automatica e Informatica
Corso Duca degli Abruzzi 24
10129 Torino - Italy
e-mail: pmo@computer.org