Bilkent University

Displaying 1-17 of 17 results

  • White Papers // Nov 2013

    Model-Driven Transformations for Mapping Parallel Algorithms on Parallel Computing Platforms

    One of the important problems in parallel computing is the mapping of the parallel algorithm to the parallel computing platform. Hereby, for each parallel node the corresponding code for the parallel nodes must be implemented. For platforms with a limited number of processing nodes this can be done manually. However,...

    Provided By Bilkent University

  • White Papers // Nov 2013

    Architecture F ramework for Mapping Parallel Algorithms to Parallel Computing Platforms

    Mapping parallel algorithms to parallel computing platforms requires several activities such as the analysis of the parallel algorithm, the definition of the logical configuration of the platform, and the mapping of the algorithm to the logical configuration platform. Unfortunately, in current parallel computing approaches there does not seem to be...

    Provided By Bilkent University

  • White Papers // May 2013

    Coding Schemes for Broadcast Erasure Channels With Feedback: The Two Multicast Case

    The authors consider the single hop broadcast packet erasure channel (BPEC) with two multicast sessions (each of them destined to a different group of N users) and regularly available instantaneous receiver ACK/NACK feedback. Using the insight gained from recent work on BPEC with unicast and degraded messages,, they propose a...

    Provided By Bilkent University

  • White Papers // Feb 2013

    Reliability-Aware Heterogeneous 3D Chip Multiprocessor Design

    Ability to stack separate chips in a single package enables Three-Dimensional Integrated Circuits (3D ICs). Heterogeneous 3D ICs provide even better opportunities to reduce the power and increase the performance per unit area. An important issue in designing a heterogeneous 3D IC is reliability. To achieve this, one needs to...

    Provided By Bilkent University

  • White Papers // Feb 2013

    Auto-Tuning Similarity Search Algorithms on Multi-Core Architectures

    In recent times, large high-dimensional datasets have become ubiquitous. Video and image repositories, financial, and sensor data are just a few examples of such datasets in practice. Many applications that use such datasets require the retrieval of data items similar to a given query item, or the Nearest Neighbors (NN...

    Provided By Bilkent University

  • White Papers // Jan 2013

    Joint Compartmented Threshold Access Structures

    A secret sharing scheme is a method of distributing a secret value among members of a group such that only certain coalitions of these participants can find the secret. A subset of users that can recover the secret is called a qualified coalition, and the set of all qualified coalitions...

    Provided By Bilkent University

  • White Papers // Dec 2012

    ILP-Based Communication Reduction for Heterogeneous 3D Network-on-Chips

    Network-on-Chip (NoC) architectures and Three-Dimensional Integrated Circuits (3D ICs) have been introduced as attractive options for overcoming the barriers in interconnect scaling while increasing the number of cores. Combining these two approaches is expected to yield better performance and higher scalability. This paper explores the possibility of combining these two...

    Provided By Bilkent University

  • White Papers // Sep 2012

    Generic Construction of Trace and Revoke Schemes

    Broadcast Encryption (BE) is a cryptographic primitive that allows a broad-caster to encrypt a content to a specific group of users called privileged users and prevent revoked users from decrypting the content. In BE schemes, a group of users, called traitor s may leak their keys and allow illegal reception...

    Provided By Bilkent University

  • White Papers // May 2012

    Reliability-Aware 3D Chip Multiprocessor Design

    Ability to stack separate chips in a single package enables Three-Dimensional Integrated Circuits (3D ICs). Heterogeneous 3D ICs provide even better opportunities to reduce the power and increase the performance per unit area. An important issue in designing a heterogeneous 3D IC is reliability. To achieve this, one needs to...

    Provided By Bilkent University

  • White Papers // Feb 2012

    On Erasure Correction Coding for Streaming

    The authors consider packet erasure correction coding for a streaming system where specific information needs to be decoded by specific deadlines, in order to ensure uninterrupted playback at the receiver. In their previous work, they gave a capacity-achieving code construction for the case of a fixed number of erasures. In...

    Provided By Bilkent University

  • White Papers // Jan 2011

    Characterizing Gnutella Network Properties for Peer-to-Peer Network Simulation

    A P2P network that is overlayed over Internet can consist of thousands, or even millions of nodes. To analyze the performance of a P2P network, or an algorithm or protocol designed for a P2P network, simulation studies have to be performed quite often, and simulation studies require the use of...

    Provided By Bilkent University

  • White Papers // Oct 2009

    Time Delay Estimation in Cognitive Radio Systems

    In cognitive radio systems, secondary users can utilize multiple dispersed bands that are not used by primary users. In this paper, time delay estimation of signals that occupy multiple dispersed bands is studied. First, theoretical limits on time delay estimation are reviewed. Then, two-step time delay estimators that provide trade-offs...

    Provided By Bilkent University

  • White Papers // Oct 2009

    Distributed and Location-BasedMulticast Routing Algorithms For Wireless Sensor Networks

    Multicast routing protocols in wireless sensor networks are required for sending the same message to multiple different destinations. In this paper, the authors propose two different distributed algorithms for multicast routing in wireless sensor networks which make use of location information of sensor nodes. The authors' first algorithm groups the...

    Provided By Bilkent University

  • White Papers // Jul 2009

    Joint Visual Attention Modeling for Naturally Interacting Robotic Agents

    This paper elaborates on mechanisms for establishing visual joint attention for the design of robotic agents that learn through natural interfaces, following a developmental trajectory not unlike infants. The authors describe first the evolution of cognitive skills in infants and then the adaptation of cognitive development patterns in robotic design....

    Provided By Bilkent University

  • White Papers // Dec 2008

    Peer-to-Peer Overlay in Mobile Ad-Hoc Networks

    Wireless multi-hop networks such as Mobile Ad-hoc (MANET) or Wireless Mesh Networks (WMNs) have attracted big research efforts during the last years as they have huge potential in several areas such as military communications, fast infrastructure replacement during emergency operations, extension of hotspots or as an alternative communication system. Due...

    Provided By Bilkent University

  • White Papers // Oct 2007

    A Link-Based Storage Scheme for Efficient Aggregate Query Processing on Clustered Road Networks

    The need to have efficient storage schemes for spatial networks is apparent when the volume of query processing in some road networks (e.g., the navigation systems) is considered. Specifically, under the assumption that the road network is stored in a central server, the adjacent data elements in the network must...

    Provided By Bilkent University

  • White Papers // Jul 2006

    An Efficient Parallel Spatial Subdivision Algorithm for Object-Based Parallel Ray Tracing

    Parallel ray tracing of complex scenes on multi-computers requires distribution of both computations and scene data to the processors. This is carried out during preprocessing and usually consumes too much time and memory. In this paper, the authors present an efficient parallel subdivision algorithm to decompose a given scene into...

    Provided By Bilkent University

  • White Papers // Sep 2012

    Generic Construction of Trace and Revoke Schemes

    Broadcast Encryption (BE) is a cryptographic primitive that allows a broad-caster to encrypt a content to a specific group of users called privileged users and prevent revoked users from decrypting the content. In BE schemes, a group of users, called traitor s may leak their keys and allow illegal reception...

    Provided By Bilkent University

  • White Papers // Oct 2009

    Time Delay Estimation in Cognitive Radio Systems

    In cognitive radio systems, secondary users can utilize multiple dispersed bands that are not used by primary users. In this paper, time delay estimation of signals that occupy multiple dispersed bands is studied. First, theoretical limits on time delay estimation are reviewed. Then, two-step time delay estimators that provide trade-offs...

    Provided By Bilkent University

  • White Papers // May 2013

    Coding Schemes for Broadcast Erasure Channels With Feedback: The Two Multicast Case

    The authors consider the single hop broadcast packet erasure channel (BPEC) with two multicast sessions (each of them destined to a different group of N users) and regularly available instantaneous receiver ACK/NACK feedback. Using the insight gained from recent work on BPEC with unicast and degraded messages,, they propose a...

    Provided By Bilkent University

  • White Papers // Oct 2009

    Distributed and Location-BasedMulticast Routing Algorithms For Wireless Sensor Networks

    Multicast routing protocols in wireless sensor networks are required for sending the same message to multiple different destinations. In this paper, the authors propose two different distributed algorithms for multicast routing in wireless sensor networks which make use of location information of sensor nodes. The authors' first algorithm groups the...

    Provided By Bilkent University

  • White Papers // Jan 2011

    Characterizing Gnutella Network Properties for Peer-to-Peer Network Simulation

    A P2P network that is overlayed over Internet can consist of thousands, or even millions of nodes. To analyze the performance of a P2P network, or an algorithm or protocol designed for a P2P network, simulation studies have to be performed quite often, and simulation studies require the use of...

    Provided By Bilkent University

  • White Papers // Dec 2008

    Peer-to-Peer Overlay in Mobile Ad-Hoc Networks

    Wireless multi-hop networks such as Mobile Ad-hoc (MANET) or Wireless Mesh Networks (WMNs) have attracted big research efforts during the last years as they have huge potential in several areas such as military communications, fast infrastructure replacement during emergency operations, extension of hotspots or as an alternative communication system. Due...

    Provided By Bilkent University

  • White Papers // Jul 2009

    Joint Visual Attention Modeling for Naturally Interacting Robotic Agents

    This paper elaborates on mechanisms for establishing visual joint attention for the design of robotic agents that learn through natural interfaces, following a developmental trajectory not unlike infants. The authors describe first the evolution of cognitive skills in infants and then the adaptation of cognitive development patterns in robotic design....

    Provided By Bilkent University

  • White Papers // Feb 2012

    On Erasure Correction Coding for Streaming

    The authors consider packet erasure correction coding for a streaming system where specific information needs to be decoded by specific deadlines, in order to ensure uninterrupted playback at the receiver. In their previous work, they gave a capacity-achieving code construction for the case of a fixed number of erasures. In...

    Provided By Bilkent University

  • White Papers // Feb 2013

    Reliability-Aware Heterogeneous 3D Chip Multiprocessor Design

    Ability to stack separate chips in a single package enables Three-Dimensional Integrated Circuits (3D ICs). Heterogeneous 3D ICs provide even better opportunities to reduce the power and increase the performance per unit area. An important issue in designing a heterogeneous 3D IC is reliability. To achieve this, one needs to...

    Provided By Bilkent University

  • White Papers // Oct 2007

    A Link-Based Storage Scheme for Efficient Aggregate Query Processing on Clustered Road Networks

    The need to have efficient storage schemes for spatial networks is apparent when the volume of query processing in some road networks (e.g., the navigation systems) is considered. Specifically, under the assumption that the road network is stored in a central server, the adjacent data elements in the network must...

    Provided By Bilkent University

  • White Papers // Jul 2006

    An Efficient Parallel Spatial Subdivision Algorithm for Object-Based Parallel Ray Tracing

    Parallel ray tracing of complex scenes on multi-computers requires distribution of both computations and scene data to the processors. This is carried out during preprocessing and usually consumes too much time and memory. In this paper, the authors present an efficient parallel subdivision algorithm to decompose a given scene into...

    Provided By Bilkent University

  • White Papers // Feb 2013

    Auto-Tuning Similarity Search Algorithms on Multi-Core Architectures

    In recent times, large high-dimensional datasets have become ubiquitous. Video and image repositories, financial, and sensor data are just a few examples of such datasets in practice. Many applications that use such datasets require the retrieval of data items similar to a given query item, or the Nearest Neighbors (NN...

    Provided By Bilkent University

  • White Papers // Jan 2013

    Joint Compartmented Threshold Access Structures

    A secret sharing scheme is a method of distributing a secret value among members of a group such that only certain coalitions of these participants can find the secret. A subset of users that can recover the secret is called a qualified coalition, and the set of all qualified coalitions...

    Provided By Bilkent University

  • White Papers // May 2012

    Reliability-Aware 3D Chip Multiprocessor Design

    Ability to stack separate chips in a single package enables Three-Dimensional Integrated Circuits (3D ICs). Heterogeneous 3D ICs provide even better opportunities to reduce the power and increase the performance per unit area. An important issue in designing a heterogeneous 3D IC is reliability. To achieve this, one needs to...

    Provided By Bilkent University

  • White Papers // Dec 2012

    ILP-Based Communication Reduction for Heterogeneous 3D Network-on-Chips

    Network-on-Chip (NoC) architectures and Three-Dimensional Integrated Circuits (3D ICs) have been introduced as attractive options for overcoming the barriers in interconnect scaling while increasing the number of cores. Combining these two approaches is expected to yield better performance and higher scalability. This paper explores the possibility of combining these two...

    Provided By Bilkent University

  • White Papers // Nov 2013

    Model-Driven Transformations for Mapping Parallel Algorithms on Parallel Computing Platforms

    One of the important problems in parallel computing is the mapping of the parallel algorithm to the parallel computing platform. Hereby, for each parallel node the corresponding code for the parallel nodes must be implemented. For platforms with a limited number of processing nodes this can be done manually. However,...

    Provided By Bilkent University

  • White Papers // Nov 2013

    Architecture F ramework for Mapping Parallel Algorithms to Parallel Computing Platforms

    Mapping parallel algorithms to parallel computing platforms requires several activities such as the analysis of the parallel algorithm, the definition of the logical configuration of the platform, and the mapping of the algorithm to the logical configuration platform. Unfortunately, in current parallel computing approaches there does not seem to be...

    Provided By Bilkent University