• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 9,071
Next 10 →

Parallel Sorting With Limited Bandwidth

by Micah Adler, John W Byers, Richard M Karp - in Proc. 7th ACM Symp. on Parallel Algorithms and Architectures , 1995
"... We study the problem of sorting on a parallel computer with limited communication bandwidth. By using the recently proposed PRAM(m) model, where p processors communicate through a small, globally shared memory consisting of m bits, we focus on the trade-off between the amount of local computation an ..."
Abstract - Cited by 27 (5 self) - Add to MetaCart
We study the problem of sorting on a parallel computer with limited communication bandwidth. By using the recently proposed PRAM(m) model, where p processors communicate through a small, globally shared memory consisting of m bits, we focus on the trade-off between the amount of local computation

Limited Bandwidth to Affect Processor Design

by Doug Burger , 1997
"... this article, ..."
Abstract - Cited by 25 (0 self) - Add to MetaCart
this article,

Exploiting Locality for Data Management in Systems of Limited Bandwidth

by Bruce Maggs, Friedhelm Meyer Auf Der Heide, Berthold Vöcking, Matthias Westermann - IN PROCEEDINGS OF THE 38TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE , 1997
"... This paper deals with data management in computer systems in which the computing nodes are connected by a relatively sparse network. We consider the problem of placing and accessing a set of shared objects that are read and written from the nodes in the network. These objects are, e.g., global varia ..."
Abstract - Cited by 27 (3 self) - Add to MetaCart
This paper deals with data management in computer systems in which the computing nodes are connected by a relatively sparse network. We consider the problem of placing and accessing a set of shared objects that are read and written from the nodes in the network. These objects are, e.g., global variables in a parallel program, pages or cache lines in a virtual shared memory system, shared files in a distributed file system, or pages in the World Wide Web. A data management strategy consists of a placement strategy that maps the objects (possibly dynamically and with redundancy) to the nodes, and an access strategy that describes how reads and writes are handled by the system (including the routing). We investigate static and dynamic data management strategies. In the static model, we assume that we are given an application for which the rates of read and write accesses for all node--object pairs are known. The goal is to calculate a static placement of the objects to the nodes in the ne...

Efficient Distributed Source Detection with Limited Bandwidth

by Christoph Lenzen, David Peleg
"... Given a simple graph G = (V, E) and a set of sources S ⊆ V, denote for each node v ∈ V by L (∞) v the lexicographically ordered list of distance/source pairs (d(s, v), s), where s ∈ S. For integers d, k ∈ N∪{∞}, we consider the source detection, or (S, d, k)-detection task, requiring each node v to ..."
Abstract - Cited by 2 (2 self) - Add to MetaCart
Given a simple graph G = (V, E) and a set of sources S ⊆ V, denote for each node v ∈ V by L (∞) v the lexicographically ordered list of distance/source pairs (d(s, v), s), where s ∈ S. For integers d, k ∈ N∪{∞}, we consider the source detection, or (S, d, k)-detection task, requiring each node v to learn the (if for all of them d(s, v) ≤ d) or all entries (d(s, v), s) ∈ L (∞) v satisfying that d(s, v) ≤ d (otherwise). Solutions to this problem provide natural generalizations of concurrent breadth-first search (BFS) tree constructions. For example, the special case of k = ∞ requires each source s ∈ S to build a complete BFS tree rooted at s, whereas the special case of d = ∞ and S = V requires constructing a partial BFS tree comprising at least k nodes from every node in V. In this work, we give a simple, near-optimal solution for the source detection task in the CONGEST model, where messages contain at most O(log n) bits, running in d + k rounds. We demonstrate its utility for various routing problems, exact and approximate diameter computation, and spanner construction. For those problems, we obtain algorithms in the CONGEST model that are faster and in some cases much simpler than previous solutions. first k entries of L (∞)

On limits of wireless communications in a fading environment when using multiple antennas

by G. J. Foschini, M. J. Gans - Wireless Personal Communications , 1998
"... Abstract. This paper is motivated by the need for fundamental understanding of ultimate limits of bandwidth efficient delivery of higher bit-rates in digital wireless communications and to also begin to look into how these limits might be approached. We examine exploitation of multi-element array (M ..."
Abstract - Cited by 2426 (14 self) - Add to MetaCart
Abstract. This paper is motivated by the need for fundamental understanding of ultimate limits of bandwidth efficient delivery of higher bit-rates in digital wireless communications and to also begin to look into how these limits might be approached. We examine exploitation of multi-element array

Coordinating multiple robots during exploration under communication with limited bandwidth

by Daniel Meier, Cyrill Stachniss, Wolfram Burgard - in European Conference on Mobile Robots , 2005
"... In this paper, we consider the problem of exploring an unknown environment with a team of mobile robots using a communication link with limited bandwidth. The key problem to be solved in this context is to decide which information should be transmitted over the network to enable the robots to choose ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
In this paper, we consider the problem of exploring an unknown environment with a team of mobile robots using a communication link with limited bandwidth. The key problem to be solved in this context is to decide which information should be transmitted over the network to enable the robots

The Future of Wires

by Mark Horowitz, Ron Ho, Ken Mai , 1999
"... this paper we first discuss the wire metrics of interest and examine them in a contemporary 0.25m process. We then discuss technology scaling over the next several generations, from SIA and other predictions, and how our wire metrics trend over that time. We will examine the delay and bandwidth lim ..."
Abstract - Cited by 516 (7 self) - Add to MetaCart
this paper we first discuss the wire metrics of interest and examine them in a contemporary 0.25m process. We then discuss technology scaling over the next several generations, from SIA and other predictions, and how our wire metrics trend over that time. We will examine the delay and bandwidth

Vogels, U-Net: a user-level network interface for parallel and distributed computing, in:

by Anindya Basu , Vineet Buch , Werner Vogels , Thorsten Von Eicken - Proceedings of the 15th ACM Symposium on Operating System Principles, ACM, , 1995
"... Abstract The U-Net communication architecture provides processes with a virtual view of a network device to enable user-level access to high-speed communication devices. The architecture, implemented on standard workstations using off-the-shelf ATM communication hardware, removes the kernel from th ..."
Abstract - Cited by 597 (17 self) - Add to MetaCart
the communication path, while still providing full protection. The model presented by U-Net allows for the construction of protocols at user level whose performance is only limited by the capabilities of network. The architecture is extremely flexible in the sense that traditional protocols like TCP and UDP

Tinysec: A link layer security architecture for wireless sensor networks

by Chris Karlof, Naveen Sastry, David Wagner - in Proc of the 2nd Int’l Conf on Embedded Networked Sensor Systems
"... We introduce TinySec, the first fully-implemented link layer security architecture for wireless sensor networks. In our design, we leverage recent lessons learned from design vulnerabilities in security protocols for other wireless networks such as 802.11b and GSM. Conventional security protocols te ..."
Abstract - Cited by 521 (0 self) - Add to MetaCart
tend to be conservative in their security guarantees, typically adding 16–32 bytes of overhead. With small memories, weak processors, limited energy, and 30 byte packets, sensor networks cannot afford this luxury. TinySec addresses these extreme resource constraints with careful design; we explore

A General Scheme for Optimization of Trigger Rates in an Experiment with Limited Bandwidth

by H.-C. Schultz-Coulon, J. Coughlan, E. Elsen, T. Nicholls, H. Rick
"... Modern, general purpose high energy physics experiments are designed to record the events of physics processes which greatly differ in rate. Both rare signatures with trigger rates of order 1 Hz and minimum bias interactions with rates sometimes approaching 1 MHz have to be triggered at the same tim ..."
Abstract - Add to MetaCart
time. The typical means of accommodating these requirements within a limited bandwidth is to downscale individual trigger channels appropriately. This paper describes a novel procedure for finding an optimized set of downscale factors that automatically adapts to the beam conditions. A first
Next 10 →
Results 1 - 10 of 9,071
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University