Technion - Israel Institute of Technology

Displaying 1-40 of 48 results

  • White Papers // Jun 2014

    GP-SIMD Processing-in-Memory

    The authors present GP-SIMD, a novel hybrid general purpose SIMD computer architecture that resolves the issue of synchronization by in-memory computing, through combining data storage and massively parallel processing. The GP-SIMD's arithmetic, logic and associative characteristics and its intercommunication network are discussed. GP-SIMD employs modified SRAM storage cells. An analytic...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Jun 2014

    Eleven Ways to Boost Your Synchronizer

    Synchronizers play a key role in modern multiple clock System-on-Chip (SoC) designs. Such designs present thousands of Clock Domain Crossings (CDC) where the system is prone to metastability errors. To mitigate those failures and ensure reliable signal transition between CDCs, synchronizers are used to convert domain timings. The type of...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Jun 2014

    Amdahl's Law in the 3-D Era

    In this paper, the authors study the effect of 3-D Chip Multi-Processor (CMP) integration on Amdahl's law. The influence of vertical communication and thermal gradients on CMP performance and scalability is studied from Amdahl's law perspective. They find that a fast vertical connectivity enabled by 3-D implementation shifts the optimum...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Jun 2014

    SAL: Scaling Data Centers Using Smart Address Learning

    Multi-tenant data centers provide a cost-effective many-server infrastructure for hosting large-scale applications. These data centers can run multiple Virtual Machines (VMs) for each tenant, and potentially place any of these VMs on any of the servers. Therefore, for inter-VM communication, they also need to provide a VM resolution method that...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Apr 2014

    Local Rank Modulation for Flash Memories

    Flash memory is a non-volatile technology that is both electrically programmable and electrically erasable. It incorporates a set of cells maintained at a set of levels of charge to encode information. While raising the charge level of a cell is an easy operation, reducing the charge level requires the erasure...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Feb 2014

    Scaling Multi-Core Network Processors Without the Reordering Bottleneck

    Today, designers of Network Processors (NPs) strive to keep the packet reception and transmission orders identical, and therefore avoid any possible out-of-order transmission. However, the development of new features in advanced network processors has resulted in increasingly parallel architectures and increasingly heterogeneous packet processing times, leading to large reordering delays....

    Provided By Technion - Israel Institute of Technology

  • White Papers // Jan 2014

    Convex Optimization of Resource Allocation in Asymmetric and Heterogeneous MultiCores

    Chip area, power consumption, execution time, off-chip memory bandwidth, overall cache miss rate and Network-on-Chip (NoC) capacity are limiting the scalability of Chip Multi-Processors (CMP). Consider a workload comprising a sequential and multiple concurrent tasks and asymmetric or heterogeneous multi-core architecture. A convex optimization framework is proposed, for selecting the...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Nov 2013

    Optimization of Asymmetric and Heterogeneous MultiCore

    An analytical optimization model, based on Lagrange multipliers, allocates constrained area and power among the cores of either asymmetric or heterogeneous multicore so as to optimize execution time. While in the asymmetric multicore each one of the concurrent workload task may execute on any core, concurrent tasks are pre-assigned to...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Oct 2013

    Computer Architecture with Associative Processor Replacing Last Level Cache and SIMD Accelerator

    In this paper, the authors present a computer architecture where a last level cache and a SIMD accelerator are replaced by an Associative Processor (AP). Associative Processor (AP) combines data storage and processing, and functions as a parallel SIMD processor and a memory at the same time. An analytic performance...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Sep 2013

    StarSync: An Extendable Standard-Cell Mesochronous Synchronizer

    StarSync, a mesochronous synchronizer, enables low latency and full throughput crossing of clock domain boundaries having same frequency but different phases. Full back pressure is supported, where the receiver can start and stop accepting words without any data loss. Variable depth buffering is provided, supporting a wide range of short...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Aug 2013

    Power and Thermal Constraints of Modern System-on-a-Chip Computer

    Power and thermal are major constraints for delivering compute performance in high-end CPU and are expected to be so in the future. For high end processors, junction temperature has been considered the toughest physical constraint that needs to be tightly managed. Recent trends in form-factors and the increased focus on...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Jul 2013

    3D Cache Hierarchy Optimization

    3D integration has the potential to improve the scalability and performance of Chip Multi-Processor (CMP). A closed form analytical solution for optimizing 3D CMP cache hierarchy is developed. It allows optimal partitioning of the cache hierarchy levels into 3D silicon layers and optimal allocation of area among cache hierarchy levels...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Jun 2013

    Fluid Limits for Many-Server Systems with Reneging Under a Priority Policy

    A multi-class many-server system is considered, in which customers are served according to a non-preemptive priority policy and may renege while waiting to enter service. The service and reneging time distributions satisfy mild conditions. Building on an approach developed by the researchers, the law-of-large-numbers many-server asymptotics are characterized as the...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Mar 2013

    MTBF Estimation in Coherent Clock Domains

    Special synchronizers exist for special clock relations such as mesochronous, multi-synchronous and ratiochronous clocks, while variants of N-flip-flop synchronizers are employed when the communicating clocks are asynchronous. N-flip-flop synchronizers are also used in all special cases, at the cost of longer latency than when using specialized synchronizers. The reliability of...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Jan 2013

    Cost Aware Fault Recovery in Clouds

    Maintaining high availability of IaaS services at a reasonable cost is a challenging task that received recent attention due to the growing popularity of Cloud computing as a preferred means of affordable IT outsourcing. In large data-centers faults are prone to happen and thus the only reasonable cost-effective method of...

    Provided By Technion - Israel Institute of Technology

  • White Papers // May 2012

    Performance of a Hardware Scheduler for Many-Core Architecture

    A hardware scheduler for many-core architectures enables fast scheduling and allocation of fine granularity tasks to all cores. The authors present performance evaluation of a hardware scheduler for HyperCore, many-core architecture. The evaluation is based on an architectural simulator, using multiple benchmarks representing a wide variety of inherent parallelism. Several...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Feb 2012

    Wyner-Ziv Type Versus Noisy Network Coding for a State-Dependent MAC

    The authors consider a two-user state-dependent multi-access channel in which the states of the channel are known non-causally to one of the encoders and only strictly causally to the other encoder. Both encoders transmit a common message and, in addition, the encoder that knows the states non-causally transmits an individual...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Jan 2012

    Minimal Cost Reconfiguration of Data Placement in Storage Area Network

    Video-on-Demand (VoD) services require frequent updates in file configuration on the storage subsystem, so as to keep up with the frequent changes in movie popularity. This defines a natural reconfiguration problem in which the goal is to minimize the cost of moving from one file configuration to another. The cost...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Dec 2011

    On the Admission of Dependent Flows in Powerful Sensor Networks

    In this paper, the authors define and study a new problem, referred to as the Dependent Unsplittable Flow Problem (D-UFP). They present and discuss this problem in the context of large-scale powerful (radar/camera) sensor networks, but they believe it has important applications on the admission of large flows in other...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Jul 2011

    Programmable Protocols for Social Networks

    The authors study automation in social networks using protocols. They introduce a generic social protocol which addresses the basic problem of making a determination of status regarding an entity in the social network (e.g., an event such as a party, a conference, a demonstration, a commercial offer etc.). The generic...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Jun 2011

    Efficient Location-Based Decision Supporting Content Distribution to Mobile Groups

    The paper deals with efficient location-based decision supporting content distribution to mobile groups. The authors consider the case where a set of Information Dissemination Devices (IDDs) broadcast a limited amount of location-based information to passing mobile nodes that are moving along well-defined paths. They develop a novel model that captures...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Apr 2011

    Energy-Delay Optimization in an Asynchronous Sensor Network With Multiple Gateways

    This paper studies the problem of energy efficient routing in a sensor network with multiple gateways. Due to the complexity of this problem, the authors divide it into two sub-problems: the problem of constructing efficient routing trees and the problem of wake-up frequency assignment in a network with multiple routing...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Apr 2011

    Efficient Allocation of CQI Channels in Broadband Wireless Networks

    In an OFDMA network, the Modulation and Coding Scheme (MCS) of the messages sent to the Mobile Stations (MSs) varies according to channel condition. To determine the appropriate MCS level, the Base Station (BS) allocates to every active MS a CQI (Channel Quality Information) channel. The CQI bandwidth is a...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Mar 2011

    Multiple Access Channel With States Known Noncausally at One Encoder and Only Strictly Causally at the Other Encoder

    The authors consider a two-user state-dependent multi-access channel in which the states of the channel are known non-causally to one of the encoders and only strictly causally to the other encoder. Both encoders transmit a common message and, in addition, the encoder that knows the states non-causally transmits an individual...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Feb 2011

    Capacity of Multiple Access Channel With States Known Noncausally at One Encoder and Only Strictly Causally at the Other Encoder

    The capacity of a two-user state-dependent multiple access channel with common message and states known non-causally at only one encoder is established in, for both Discrete Memoryless (DM) and memoryless Gaussian cases. Lower and non-trivial upper bounds in the DM case and an alternative proof of the capacity for the...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Jan 2011

    A Generic Scheme for Estimating the Size of a Group While Avoiding Feedback Implosion

    The authors present a probabilistic polling scheme for estimating the size of a group of nodes affected by the same event. They analyze the bias of the proposed scheme and show how it can be completely eliminated. Their scheme differs from previous work in several important ways. First, it is...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Jan 2011

    Locally Vs. Globally Optimized Flow-Based Content Distribution to Mobile Groups

    The paper deals with efficient distribution of timely information to mobile groups. The authors consider the case where a set of Information Dissemination Devices (IDDs) broadcast a limited amount of information to passing mobile nodes that are moving along well-defined paths. This is the case, for example, in intelligent transportation...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Jan 2011

    Computational Analysis and Efficient Algorithms for Micro and Macro OFDMA Downlink Scheduling

    OFDMA is one of the most important modulation and access methods for the future mobile networks. Before transmitting a frame on the downlink, an OFDMA base station has to invoke an algorithm that determines which of the pending packets will be transmitted, what modulation should be used for each of...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Jan 2011

    Continuous Neighbor Discovery in Asynchronous Sensor Networks

    In most sensor networks the nodes are static. Nevertheless, node connectivity is subject to changes because of disruptions in wireless communication, transmission power changes, or loss of synchronization between neighboring nodes. Hence, even after a sensor is aware of its immediate neighbors, it must continuously maintain its view, a process...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Jan 2011

    An Optimal Wake-Up Scheduling Algorithm for Minimizing Energy Consumption While Limiting Maximum Delay in a Mesh Sensor Network

    This paper presents an algorithm for maximizing the lifetime of a sensor network while guaranteeing an upper bound on the end-to-end delay. The authors prove that the proposed algorithm is optimal, and that it requires simple computing operations that can be implemented by simple devices. To the best of their...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Jan 2011

    On the Computational Complexity and Effectiveness of N-Hub Shortest-Path Routing

    In this paper, the authors study the computational complexity and effectiveness of a concept they term "N-hub Shortest-Path Routing" in IP networks. N-hub Shortest-Path Routing allows the ingress node of a routing domain to determine up to N intermediate nodes (hubs) through which a packet will pass before reaching its...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Jan 2011

    Link Division Multiplexing (LDM) for Network-on-Chip Links

    Large Systems-on-Chip (SoC) can employ packet-switched Networks on-Chip with Quality-of-Service (QNoC) architecture. Communication in QNoC links typically involves Time Division Multiplexing (TDM). In this paper the authors propose the Link Division Multiplexing (LDM) technique based on optimal division of link wires among the data blocks of various applications and QoS...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Jan 2011

    On Reliable Dissemination in Wireless Ad-Hoc Networks

    Reliable broadcast is a basic service for many collaborative applications as it provides reliable dissemination of the same information to many recipients. This paper studies three common approaches for achieving scalable reliable broadcast in ad-hoc networks, namely probabilistic flooding, counter based broadcast, and lazy gossip. The strength and weaknesses of...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Oct 2010

    A Multipath Routing Algorithm for Mobile Wireless Sensor Networks

    Providing reliable and yet energy efficient routing protocols is of an utmost importance in Wireless Sensor Networks. Wireless Sensor Networks imply multi-hop data forwarding over unreliable and moving nodes. When selecting the appropriate routing paradigm, the main challenge is to find the right equilibrium between the quality of data delivery...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Mar 2010

    SMV: Selective Multi-Versioning STM

    The authors present Selective Multi-Versioning (SMV), a new STM that reduces the number of aborts, especially those of long read-only transactions. SMV keeps old object versions as long as they might be useful for some transaction to read. SMV is able to do this while still allowing reading transactions to...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Mar 2010

    Network-on-Chip Architectures for Neural Networks

    Providing highly flexible connectivity is a major architectural challenge for hardware implementation of reconfigurable neural networks. The authors perform an analytical evaluation and comparison of different configurable interconnect architectures (mesh NoC, tree, shared bus and point-to-point) emulating variants of two neural network topologies (having full and random exponential configurable connectivity)....

    Provided By Technion - Israel Institute of Technology

  • White Papers // Dec 2009

    A Scalable Scheme for Preventing Feedback Implosion in a Large-Scale Multi-Tier Sensor Network

    The authors consider a huge hierarchical sensor network consisting of millions of sensors arranged in clusters for scalability and cost-performance. They address the problem of how a centralized gateway can estimate the number of sensors affected by a certain event. They propose a scheme for solving this problem in the...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Aug 2009

    Maximizing Restorable Throughput in MPLS NetworksLS Networks

    MPLS recovery mechanisms are increasing in popularity because they can guarantee fast restoration and high QoS assurance. Their main advantage is that their backup paths are established in advance, before a failure event takes place. Most research on the establishment of primary and backup paths has focused on minimizing the...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Aug 2009

    Low-Overhead Error Detection for Networks-on-Chip

    In the current deep sub-micron age, interconnect reliability is a subject of major concern, and is crucial for a successful product. Coding is a widely-used method to achieve communication reliability, which can be very useful in a Network-on-Chip (NoC). A key challenge for NoC error detection is to provide a...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Jul 2009

    Reliable Architecture for Flash Memory

    The mounting demand for high density non-volatile flash memories consequences new challenges of flash memory reliability issues [1, 2]. Common reliability-improving techniques approaches are addressing device and process manufacturing improvements [3] or Error Correction Codes (ECC) techniques [4]. This paper proposes a novel memory architecture and method of increasing reliability...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Feb 2012

    Wyner-Ziv Type Versus Noisy Network Coding for a State-Dependent MAC

    The authors consider a two-user state-dependent multi-access channel in which the states of the channel are known non-causally to one of the encoders and only strictly causally to the other encoder. Both encoders transmit a common message and, in addition, the encoder that knows the states non-causally transmits an individual...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Mar 2011

    Multiple Access Channel With States Known Noncausally at One Encoder and Only Strictly Causally at the Other Encoder

    The authors consider a two-user state-dependent multi-access channel in which the states of the channel are known non-causally to one of the encoders and only strictly causally to the other encoder. Both encoders transmit a common message and, in addition, the encoder that knows the states non-causally transmits an individual...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Feb 2011

    Capacity of Multiple Access Channel With States Known Noncausally at One Encoder and Only Strictly Causally at the Other Encoder

    The capacity of a two-user state-dependent multiple access channel with common message and states known non-causally at only one encoder is established in, for both Discrete Memoryless (DM) and memoryless Gaussian cases. Lower and non-trivial upper bounds in the DM case and an alternative proof of the capacity for the...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Jul 2009

    A Route-Control Mechanism for Improving the Performance of Transport Protocols in a MANET

    The authors propose a new cross-layer mechanism, referred to as Route-control, for Mobile Ad-hoc NETworks (MANETs). This mechanism, which works in the Network and Transport layers, aims at enhancing the performance of MANETs' reliable Transport protocols. The main idea behind the proposed mechanism is to notify the sender when the...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Aug 2009

    Maximizing Restorable Throughput in MPLS NetworksLS Networks

    MPLS recovery mechanisms are increasing in popularity because they can guarantee fast restoration and high QoS assurance. Their main advantage is that their backup paths are established in advance, before a failure event takes place. Most research on the establishment of primary and backup paths has focused on minimizing the...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Jan 2011

    Locally Vs. Globally Optimized Flow-Based Content Distribution to Mobile Groups

    The paper deals with efficient distribution of timely information to mobile groups. The authors consider the case where a set of Information Dissemination Devices (IDDs) broadcast a limited amount of information to passing mobile nodes that are moving along well-defined paths. This is the case, for example, in intelligent transportation...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Jan 2011

    A Generic Scheme for Estimating the Size of a Group While Avoiding Feedback Implosion

    The authors present a probabilistic polling scheme for estimating the size of a group of nodes affected by the same event. They analyze the bias of the proposed scheme and show how it can be completely eliminated. Their scheme differs from previous work in several important ways. First, it is...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Jan 2011

    Computational Analysis and Efficient Algorithms for Micro and Macro OFDMA Downlink Scheduling

    OFDMA is one of the most important modulation and access methods for the future mobile networks. Before transmitting a frame on the downlink, an OFDMA base station has to invoke an algorithm that determines which of the pending packets will be transmitted, what modulation should be used for each of...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Jan 2011

    Continuous Neighbor Discovery in Asynchronous Sensor Networks

    In most sensor networks the nodes are static. Nevertheless, node connectivity is subject to changes because of disruptions in wireless communication, transmission power changes, or loss of synchronization between neighboring nodes. Hence, even after a sensor is aware of its immediate neighbors, it must continuously maintain its view, a process...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Jan 2011

    An Optimal Wake-Up Scheduling Algorithm for Minimizing Energy Consumption While Limiting Maximum Delay in a Mesh Sensor Network

    This paper presents an algorithm for maximizing the lifetime of a sensor network while guaranteeing an upper bound on the end-to-end delay. The authors prove that the proposed algorithm is optimal, and that it requires simple computing operations that can be implemented by simple devices. To the best of their...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Jan 2011

    On the Computational Complexity and Effectiveness of N-Hub Shortest-Path Routing

    In this paper, the authors study the computational complexity and effectiveness of a concept they term "N-hub Shortest-Path Routing" in IP networks. N-hub Shortest-Path Routing allows the ingress node of a routing domain to determine up to N intermediate nodes (hubs) through which a packet will pass before reaching its...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Oct 2010

    A Multipath Routing Algorithm for Mobile Wireless Sensor Networks

    Providing reliable and yet energy efficient routing protocols is of an utmost importance in Wireless Sensor Networks. Wireless Sensor Networks imply multi-hop data forwarding over unreliable and moving nodes. When selecting the appropriate routing paradigm, the main challenge is to find the right equilibrium between the quality of data delivery...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Jan 2012

    Minimal Cost Reconfiguration of Data Placement in Storage Area Network

    Video-on-Demand (VoD) services require frequent updates in file configuration on the storage subsystem, so as to keep up with the frequent changes in movie popularity. This defines a natural reconfiguration problem in which the goal is to minimize the cost of moving from one file configuration to another. The cost...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Jun 2011

    Efficient Location-Based Decision Supporting Content Distribution to Mobile Groups

    The paper deals with efficient location-based decision supporting content distribution to mobile groups. The authors consider the case where a set of Information Dissemination Devices (IDDs) broadcast a limited amount of location-based information to passing mobile nodes that are moving along well-defined paths. They develop a novel model that captures...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Dec 2011

    On the Admission of Dependent Flows in Powerful Sensor Networks

    In this paper, the authors define and study a new problem, referred to as the Dependent Unsplittable Flow Problem (D-UFP). They present and discuss this problem in the context of large-scale powerful (radar/camera) sensor networks, but they believe it has important applications on the admission of large flows in other...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Jul 2011

    Programmable Protocols for Social Networks

    The authors study automation in social networks using protocols. They introduce a generic social protocol which addresses the basic problem of making a determination of status regarding an entity in the social network (e.g., an event such as a party, a conference, a demonstration, a commercial offer etc.). The generic...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Jan 2009

    Exposing and Eliminating Vulnerabilities to Denial of Service Attacks in Secure Gossip-Based Multicast

    This paper proposes a framework and methodology for quantifying the effect of Denial of Service (DoS) attacks on a distributed system. They present a systematic study of the resistance of gossip-based multicast protocols to DoS attacks. They show that even distributed and randomized gossip-based protocols, which eliminate single points of...

    Provided By Technion - Israel Institute of Technology

  • White Papers // May 2009

    Best of Both Worlds: A Bus Enhanced NoC (BENoC)

    While NoCs are efficient in delivering high throughput point-to-point traffic, their multi-hop operation is too slow for latency sensitive signals. In addition, NoCS are inefficient for multicast operations. Consequently, although NoCs outperform busses in terms of scalability, they may not facilitate all the needs of future SoCs. In this paper,...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Jan 2011

    Link Division Multiplexing (LDM) for Network-on-Chip Links

    Large Systems-on-Chip (SoC) can employ packet-switched Networks on-Chip with Quality-of-Service (QNoC) architecture. Communication in QNoC links typically involves Time Division Multiplexing (TDM). In this paper the authors propose the Link Division Multiplexing (LDM) technique based on optimal division of link wires among the data blocks of various applications and QoS...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Aug 2009

    Low-Overhead Error Detection for Networks-on-Chip

    In the current deep sub-micron age, interconnect reliability is a subject of major concern, and is crucial for a successful product. Coding is a widely-used method to achieve communication reliability, which can be very useful in a Network-on-Chip (NoC). A key challenge for NoC error detection is to provide a...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Jul 2009

    Packet-Level Static Timing Analysis for NoCs

    Networks-on-Chip (NoCs) are used in a growing number of SoCs and multi-core processors, increasing the need for accurate and efficient modeling to aid the design of integrated systems. A methodology for packet-level static timing analysis in NoCs is presented. It enables quick and accurate gauging of the performance parameters of...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Jul 2009

    Reliable Architecture for Flash Memory

    The mounting demand for high density non-volatile flash memories consequences new challenges of flash memory reliability issues [1, 2]. Common reliability-improving techniques approaches are addressing device and process manufacturing improvements [3] or Error Correction Codes (ECC) techniques [4]. This paper proposes a novel memory architecture and method of increasing reliability...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Mar 2010

    SMV: Selective Multi-Versioning STM

    The authors present Selective Multi-Versioning (SMV), a new STM that reduces the number of aborts, especially those of long read-only transactions. SMV keeps old object versions as long as they might be useful for some transaction to read. SMV is able to do this while still allowing reading transactions to...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Jan 2011

    On Reliable Dissemination in Wireless Ad-Hoc Networks

    Reliable broadcast is a basic service for many collaborative applications as it provides reliable dissemination of the same information to many recipients. This paper studies three common approaches for achieving scalable reliable broadcast in ad-hoc networks, namely probabilistic flooding, counter based broadcast, and lazy gossip. The strength and weaknesses of...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Apr 2011

    Energy-Delay Optimization in an Asynchronous Sensor Network With Multiple Gateways

    This paper studies the problem of energy efficient routing in a sensor network with multiple gateways. Due to the complexity of this problem, the authors divide it into two sub-problems: the problem of constructing efficient routing trees and the problem of wake-up frequency assignment in a network with multiple routing...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Apr 2011

    Efficient Allocation of CQI Channels in Broadband Wireless Networks

    In an OFDMA network, the Modulation and Coding Scheme (MCS) of the messages sent to the Mobile Stations (MSs) varies according to channel condition. To determine the appropriate MCS level, the Base Station (BS) allocates to every active MS a CQI (Channel Quality Information) channel. The CQI bandwidth is a...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Dec 2009

    A Scalable Scheme for Preventing Feedback Implosion in a Large-Scale Multi-Tier Sensor Network

    The authors consider a huge hierarchical sensor network consisting of millions of sensors arranged in clusters for scalability and cost-performance. They address the problem of how a centralized gateway can estimate the number of sensors affected by a certain event. They propose a scheme for solving this problem in the...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Dec 2006

    QNoC Asynchronous Router with Dynamic Virtual Channel Allocation

    Large System-on-Chip (SoC) is interconnecting limited due to high area, power and delays of the internal interconnect. Requirements for wide-bandwidth inter-modular communications exacerbate the problem, incurring larger area and power costs of the interconnects. An asynchronous router for QNoC (Quality of service NoC) is presented. It combines multiple Service Levels...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Apr 2007

    Low-Complexity Policies for Energy-Performance Tradeoff in Chip-Multi-Processors

    Chip Multi-Processors (CMP) utilize multiple energy-efficient Processing Elements (PEs) to deliver high performance while maintaining an efficient ratio of performance to energy-consumption. In order to utilize CMP resources, the software application is split into multiple tasks that are executed in parallel on the PEs. Dynamic frequency-Voltage Scaling (DVS) balances performance...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Jun 2008

    Fast Universal Synchronizers

    Synchronization circuits are essential in Multi-Clock-Domain System-on-Chip (MDC SoC). The most well-known synchronizer consists of two sequentially connected flip-flops that should eliminate the propagation of metastability into the receiver clock domain. The authors first clarify how such a simple \"Two-flop\" synchronizer can be used in the system, and analyze its...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Dec 2007

    Assertion Based Verification of Multiple-Clock GALS Systems

    Standard EDA ABV tools fall short of verifying Multiple Clock Domain System-on-Chip (MCD SoC), asynchronous systems and Globally Asynchronous Locally Synchronous (GALS) systems. This paper describes a method for verifying asynchronous and multi-clock behavior in such systems using PSL and standard ABV tools. The authors convert STG (Signal Transition Graphs),...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Mar 2010

    Network-on-Chip Architectures for Neural Networks

    Providing highly flexible connectivity is a major architectural challenge for hardware implementation of reconfigurable neural networks. The authors perform an analytical evaluation and comparison of different configurable interconnect architectures (mesh NoC, tree, shared bus and point-to-point) emulating variants of two neural network topologies (having full and random exponential configurable connectivity)....

    Provided By Technion - Israel Institute of Technology

  • White Papers // May 2012

    Performance of a Hardware Scheduler for Many-Core Architecture

    A hardware scheduler for many-core architectures enables fast scheduling and allocation of fine granularity tasks to all cores. The authors present performance evaluation of a hardware scheduler for HyperCore, many-core architecture. The evaluation is based on an architectural simulator, using multiple benchmarks representing a wide variety of inherent parallelism. Several...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Aug 2013

    Power and Thermal Constraints of Modern System-on-a-Chip Computer

    Power and thermal are major constraints for delivering compute performance in high-end CPU and are expected to be so in the future. For high end processors, junction temperature has been considered the toughest physical constraint that needs to be tightly managed. Recent trends in form-factors and the increased focus on...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Jun 2013

    Fluid Limits for Many-Server Systems with Reneging Under a Priority Policy

    A multi-class many-server system is considered, in which customers are served according to a non-preemptive priority policy and may renege while waiting to enter service. The service and reneging time distributions satisfy mild conditions. Building on an approach developed by the researchers, the law-of-large-numbers many-server asymptotics are characterized as the...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Jun 2014

    SAL: Scaling Data Centers Using Smart Address Learning

    Multi-tenant data centers provide a cost-effective many-server infrastructure for hosting large-scale applications. These data centers can run multiple Virtual Machines (VMs) for each tenant, and potentially place any of these VMs on any of the servers. Therefore, for inter-VM communication, they also need to provide a VM resolution method that...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Feb 2014

    Scaling Multi-Core Network Processors Without the Reordering Bottleneck

    Today, designers of Network Processors (NPs) strive to keep the packet reception and transmission orders identical, and therefore avoid any possible out-of-order transmission. However, the development of new features in advanced network processors has resulted in increasingly parallel architectures and increasingly heterogeneous packet processing times, leading to large reordering delays....

    Provided By Technion - Israel Institute of Technology

  • White Papers // Nov 2013

    Optimization of Asymmetric and Heterogeneous MultiCore

    An analytical optimization model, based on Lagrange multipliers, allocates constrained area and power among the cores of either asymmetric or heterogeneous multicore so as to optimize execution time. While in the asymmetric multicore each one of the concurrent workload task may execute on any core, concurrent tasks are pre-assigned to...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Oct 2013

    Computer Architecture with Associative Processor Replacing Last Level Cache and SIMD Accelerator

    In this paper, the authors present a computer architecture where a last level cache and a SIMD accelerator are replaced by an Associative Processor (AP). Associative Processor (AP) combines data storage and processing, and functions as a parallel SIMD processor and a memory at the same time. An analytic performance...

    Provided By Technion - Israel Institute of Technology

  • White Papers // Jul 2013

    3D Cache Hierarchy Optimization

    3D integration has the potential to improve the scalability and performance of Chip Multi-Processor (CMP). A closed form analytical solution for optimizing 3D CMP cache hierarchy is developed. It allows optimal partitioning of the cache hierarchy levels into 3D silicon layers and optimal allocation of area among cache hierarchy levels...

    Provided By Technion - Israel Institute of Technology