Search For:

Displaying 1-50 out of 51 total
Mobile Motion Gaming: Enabling a New Class of Phone-to-Phone Action Games on Commodity Phones
Found in: IEEE Transactions on Mobile Computing
By Zengbin Zhang,David Chu,Xiaomeng Chen,Thomas Moscibroda
Issue Date:August 2013
pp. 1487-1501
Mobile gaming is a big driver of app marketplaces. However, few mobile games deliver truly distinctive gameplay experiences for ad hoc collocated users. As an example of such an experience, consider a sword fight dual between two users facing each other wh...
 
SwordFight: Exploring Phone-to-Phone Motion Games
Found in: IEEE Pervasive Computing
By Zengbin Zhang,David Chu,Xiaomeng Chen,Thomas Moscibroda
Issue Date:October 2012
pp. 8-12
A novel class of phone-to-phone mobile-motion games aims to achieve a level of physical interactivity comparable to Wii or Kinect games but without relying on an external infrastructure. The key underlying technology in these new mobile-motion games is a r...
 
SenseLess: A Database-Driven White Spaces Network
Found in: IEEE Transactions on Mobile Computing
By Rohan Murty,Ranveer Chandra,Thomas Moscibroda,Paramvir (Victor) Bahl
Issue Date:February 2012
pp. 189-203
The 2010 FCC ruling on white spaces proposes relying on a database of incumbents as the primary means of determining white space availability at any white space device (WSD). While the ruling provides broad guidelines for the database, the specifics of its...
 
Aérgia: A Network-on-Chip Exploiting Packet Latency Slack
Found in: IEEE Micro
By Reetuparna Das, Onur Mutlu, Thomas Moscibroda, Chita R. Das
Issue Date:January 2011
pp. 29-41
<p>A traditional Network-on-Chip (NoC) employs simple arbitration strategies, such as round robin or oldest first, which treat packets equally regardless of the source applications' characteristics. This is suboptimal because packets can have differe...
 
Parallelism-Aware Batch Scheduling: Enabling High-Performance and Fair Shared Memory Controllers
Found in: IEEE Micro
By Onur Mutlu, Thomas Moscibroda
Issue Date:January 2009
pp. 22-32
<p>Uncontrolled interthread interference in main memory can destroy individual threads' memory-level parallelism, effectively serializing the memory requests of a thread whose latencies would otherwise have largely overlapped, thereby reducing single...
 
Parallelism-Aware Batch Scheduling: Enhancing both Performance and Fairness of Shared DRAM Systems
Found in: Computer Architecture, International Symposium on
By Onur Mutlu, Thomas Moscibroda
Issue Date:June 2008
pp. 63-74
In a chip-multiprocessor (CMP) system, the DRAM system isshared among cores. In a shared DRAM system, requests from athread can not only delay requests from other threads by causingbank/bus/row-buffer conflicts but they can also destroy other threads’DRAM-...
 
Stall-Time Fair Memory Access Scheduling for Chip Multiprocessors
Found in: Microarchitecture, IEEE/ACM International Symposium on
By Onur Mutlu, Thomas Moscibroda
Issue Date:December 2007
pp. 146-160
DRAM memory is a major resource shared among cores in a chip multiprocessor (CMP) system. Memory requests from different threads can interfere with each other. Existing memory access scheduling techniques try to optimize the overall data throughput obtaine...
 
Fault-Tolerant Clustering in Ad Hoc and Sensor Networks
Found in: Distributed Computing Systems, International Conference on
By Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
Issue Date:July 2006
pp. 68
In this paper, we study distributed approximation algorithms for fault-tolerant clustering in wireless ad hoc and sensor networks. A k-fold dominating set of a graph G = (V,E) is a subset S of V such that every node v \in V \ S has at least k neighbors in ...
 
Maximizing the Lifetime of Dominating Sets
Found in: Parallel and Distributed Processing Symposium, International
By Thomas Moscibroda, Roger Wattenhofer
Issue Date:April 2005
pp. 242b
We investigate the problem of maximizing the lifetime of wireless ad hoc and sensor networks. Being battery powered, nodes in such networks have to perform their intended task under rigid energy restrictions that forces the designers to impose a judicious ...
 
Maximizing total upload in latency-sensitive P2P applications
Found in: Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures (SPAA '07)
By Jay R. Lorch, John R. Douceur, Thomas Moscibroda
Issue Date:June 2207
pp. 270-279
Motivated by an application in distributed gaming, we define and study the latency-constrained total upload maximization problem. In this problem, a peer-to-peer overlay network is modeled as a complete graph and each node vi has an upload bandwidth capaci...
     
Distributed approximation of capacitated dominating sets
Found in: Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures (SPAA '07)
By Fabian Kuhn, Thomas Moscibroda
Issue Date:June 2207
pp. 161-170
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph G = (V,E), and a capacity cap(v) ∈ N for each node v ∈ V , the C...
     
Fair and resilient incentive tree mechanisms
Found in: Proceedings of the 2013 ACM symposium on Principles of distributed computing (PODC '13)
By Thomas Moscibroda, Yuezhou Lv
Issue Date:July 2013
pp. 230-239
We study Incentive Tree for motivating the participation of people in crowdsourcing or human tasking systems. In an Incentive Tree, each participant is rewarded for contributing to the system, as well as for soliciting new participants into the system, who...
     
On the feasibility of user de-anonymization from shared mobile sensor data
Found in: Proceedings of the Third International Workshop on Sensing Applications on Mobile Phones (PhoneSense '12)
By Feng Zhao, Junyuan Xie, Nicholas D. Lane, Thomas Moscibroda
Issue Date:November 2012
pp. 1-5
Underpinning many recent advances in sensing applications (e.g., mHealth) is the ability to safely collect and share mobile sensor data. Research has shown that even from seemingly harmless sensors (e.g., accelerometers, gyroscopes, or magnetometers) an ev...
     
On-chip networks from a networking perspective: congestion and scalability in many-core interconnects
Found in: Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication (SIGCOMM '12)
By Chris Fallin, George P. Nychis, Onur Mutlu, Srinivasan Seshan, Thomas Moscibroda
Issue Date:August 2012
pp. 407-418
In this paper, we present network-on-chip (NoC) design and contrast it to traditional network design, highlighting similarities and differences between the two. As an initial case study, we examine network congestion in bufferless NoCs. We show that conges...
     
On the price of equivocation in byzantine agreement
Found in: Proceedings of the 2012 ACM symposium on Principles of distributed computing (PODC '12)
By Alexander Jaffe, Siddhartha Sen, Thomas Moscibroda
Issue Date:July 2012
pp. 309-318
In the Byzantine agreement problem, a set of n processors, any f of whom may be arbitrarily faulty, must reach agreement on a value proposed by one of the correct processors. It is a celebrated result that unless n > 3f, Byzantine agreement is impossib...
     
Demo: phone-to-phone mobile motion gaming on commodity phones
Found in: Proceedings of the 10th international conference on Mobile systems, applications, and services (MobiSys '12)
By David Chu, Thomas Moscibroda, Xiaomeng Chen, Zengbin Zhang
Issue Date:June 2012
pp. 497-498
No summary available.
     
SwordFight: enabling a new class of phone-to-phone action games on commodity phones
Found in: Proceedings of the 10th international conference on Mobile systems, applications, and services (MobiSys '12)
By David Chu, Thomas Moscibroda, Xiaomeng Chen, Zengbin Zhang
Issue Date:June 2012
pp. 1-14
Mobile gaming is a big driver of app marketplaces. However, few mobile games deliver truly distinctive gameplay experiences for ad hoc collocated users. As an example of such an experience, consider a sword fight dual between two users facing each other wh...
     
MadLINQ: large-scale distributed matrix computation for the cloud
Found in: Proceedings of the 7th ACM european conference on Computer Systems (EuroSys '12)
By Thomas Moscibroda, Xiuwei Chen, Zheng Zhang, Zhengping Qian, Mingcheng Chen, Nanxi Kang, Yuan Yu
Issue Date:April 2012
pp. 197-210
The computation core of many data-intensive applications can be best expressed as matrix computations. The MadLINQ project addresses the following two important research problems: the need for a highly scalable, efficient and fault-tolerant matrix computat...
     
Reducing memory interference in multicore systems via application-aware memory channel partitioning
Found in: Proceedings of the 44th Annual IEEE/ACM International Symposium on Microarchitecture (MICRO-44 '11)
By Mahmut Kandemir, Sai Prashanth Muralidhara, Thomas Moscibroda, Lavanya Subramanian, Onur Mutlu
Issue Date:December 2011
pp. 374-385
Main memory is a major shared resource among cores in a multicore system. If the interference between different applications' memory requests is not controlled effectively, system performance can degrade significantly. Previous work aimed to mitigate the p...
     
Reclaiming the white spaces: spectrum efficient coexistence with primary users
Found in: Proceedings of the Seventh COnference on emerging Networking EXperiments and Technologies (CoNEXT '11)
By George Nychis, Ivan Tashev, Peter Steenkiste, Ranveer Chandra, Thomas Moscibroda
Issue Date:December 2011
pp. 1-12
TV white spaces offer an exciting opportunity for increasing spectrum availability, but white space devices (WSDs) cannot interfere with primary users, including TV channels and wireless microphones (mics). Mics are particularly challenging because their u...
     
Sword fight with smartphones
Found in: Proceedings of the 9th ACM Conference on Embedded Networked Sensor Systems (SenSys '11)
By David Chu, Jian Qiu, Thomas Moscibroda, Zengbin Zhang
Issue Date:November 2011
pp. 403-404
We present a demonstration of a phone-to-phone Sword Fight! game. It utilizes our solution for achieving high speed 3D continuous localization described in the accompanying conference paper [1]. The approach uses acoustic cues based on time-difference of a...
     
On the feasibility of real-time phone-to-phone 3D localization
Found in: Proceedings of the 9th ACM Conference on Embedded Networked Sensor Systems (SenSys '11)
By David Chu, Jian Qiu, Thomas Moscibroda, Xiangying Meng
Issue Date:November 2011
pp. 190-203
High-speed, locational, phone-to-phone (HLPP) games and apps constitute a provocative class of mobile apps that are currently unsupported on commodity mobile devices. This work looks at a key problem for enabling HLPP: a specific variant of the localizatio...
     
The impact of memory models on software reliability in multiprocessors
Found in: Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing (PODC '11)
By Alexander Jaffe, Karin Strauss, Laura Effinger-Dean, Luis Ceze, Thomas Moscibroda
Issue Date:June 2011
pp. 89-98
The memory consistency model is a fundamental system property characterizing a multiprocessor. The relative merits of strict versus relaxed memory models have been widely debated in terms of their impact on performance, hardware complexity and programmabil...
     
Resilience of mutual exclusion algorithms to transient memory faults
Found in: Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing (PODC '11)
By Rotem Oshman, Thomas Moscibroda
Issue Date:June 2011
pp. 69-78
We study the behavior of mutual exclusion algorithms in the presence of unreliable shared memory subject to transient memory faults. It is well-known that classical 2-process mutual exclusion algorithms, such as Dekker and Peterson's algorithms, are not fa...
     
Aérgia: exploiting packet latency slack in on-chip networks
Found in: Proceedings of the 37th annual international symposium on Computer architecture (ISCA '10)
By Chita R. Das, Onur Mutlu, Reetuparna Das, Thomas Moscibroda
Issue Date:June 2010
pp. 72-ff
Traditional Network-on-Chips (NoCs) employ simple arbitration strategies, such as round-robin or oldest-first, to decide which packets should be prioritized in the network. This is counter-intuitive since different packets can have very different effects o...
     
Dynamically replicated memory: building reliable systems from nanoscale resistive memories
Found in: Proceedings of the fifteenth edition of ASPLOS on Architectural support for programming languages and operating systems (ASPLOS '10)
By Doug Burger, Edmund B. Nightingale, Engin Ipek, Jeremy Condit, Thomas Moscibroda
Issue Date:March 2010
pp. 222-230
DRAM is facing severe scalability challenges in sub-45nm tech- nology nodes due to precise charge placement and sensing hur- dles in deep-submicron geometries. Resistive memories, such as phase-change memory (PCM), already scale well beyond DRAM and are a ...
     
Application-aware prioritization mechanisms for on-chip networks
Found in: Proceedings of the 42nd Annual IEEE/ACM International Symposium on Microarchitecture (Micro-42)
By Chita R. Das, Onur Mutlu, Reetuparna Das, Thomas Moscibroda
Issue Date:December 2009
pp. 280-291
Network-on-Chips (NoCs) are likely to become a critical shared resource in future many-core processors. The challenge is to develop policies and mechanisms that enable multiple applications to efficiently and fairly share the network, to improve system per...
     
ThunderDome: discovering upload constraints using decentralized bandwidth tournaments
Found in: Proceedings of the 5th international conference on Emerging networking experiments and technologies (CoNEXT '09)
By Debmalya Panigrahi, James W. Mickens, John R. Douceur, Thomas Moscibroda
Issue Date:December 2009
pp. 193-204
ThunderDome is a system for collaboratively measuring upload bandwidths in ad-hoc peer-to-peer systems. It works by scheduling bandwidth probes between pairs of hosts, wherein each pairwise exchange reveals the upload constraint of one participant. Using t...
     
White space networking with wi-fi like connectivity
Found in: Proceedings of the ACM SIGCOMM 2009 conference on Data communication (SIGCOMM '09)
By Matt Welsh, Paramvir Bahl, Ranveer Chandra, Rohan Murty, Thomas Moscibroda
Issue Date:August 2009
pp. 101-104
Networking over UHF white spaces is fundamentally different from conventional Wi-Fi along three axes: spatial variation, temporal variation, and fragmentation of the UHF spectrum. Each of these differences gives rise to new challenges for implementing a wi...
     
Buffer management for colored packets with deadlines
Found in: Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures (SPAA '09)
By Iftah Gamzu, Prasad Raghavendra, Thomas Moscibroda, Uriel Feige, Yossi Azar
Issue Date:August 2009
pp. 1-2
We consider buffer management of unit packets with deadlines for a multi-port device with reconfiguration overhead. The goal is to maximize the throughput of the device, i.e., the number of packets delivered by their deadline. For a single port or with fre...
     
Brief announcement: collaborative measurement of upload speeds in P2P systems
Found in: Proceedings of the 28th ACM symposium on Principles of distributed computing (PODC '09)
By Debmalya Panigrahi, John Douceur, Thomas Moscibroda
Issue Date:August 2009
pp. 3-3
We define and study the bandwidth determination problem in ad-hoc P2P environments. Using point-to-point bandwidth probes, the goal is to quickly determine each host's upload and download bandwidth. We present matching upper and lower bounds on the number ...
     
A case for bufferless routing in on-chip networks
Found in: Proceedings of the 36th annual international symposium on Computer architecture (ISCA '09)
By Onur Mutlu, Thomas Moscibroda
Issue Date:June 2009
pp. 70-73
Buffers in on-chip networks consume significant energy, occupy chip area, and increase design complexity. In this paper, we make a case for a new approach to designing on-chip interconnection networks that eliminates the need for buffers for routing or flo...
     
An agile radio framework for unmanaged wireless environments
Found in: Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing (MobiHoc '09)
By Alain Gefflaut, Alexandre de Baynast, Ranveer Chandra, Thomas Moscibroda, Victor Bahl, Zhou Wang
Issue Date:May 2009
pp. 1-2
The proposed demonstration is based on commodity 802.11 wireless cards and a low cost 2.4GHz sniffing device and shows how current WLAN based networks can benefit from spectrum awareness and dynamic access to the assigned band. The demonstrator presents a ...
     
Donnybrook: enabling large-scale, high-speed, peer-to-peer games
Found in: Proceedings of the ACM SIGCOMM 2008 conference on Data communication (SIGCOMM '08)
By Ashwin Bharambe, Jacob R. Lorch, Jeffrey Pang, John R. Douceur, Srinivasan Seshan, Thomas Moscibroda, Xinyu Zhuang
Issue Date:August 2008
pp. 325
Without well-provisioned dedicated servers, modern fast-paced action games limit the number of players who can interact simultaneously to 16-32. This is because interacting players must frequently exchange state updates, and high player counts would exceed...
     
A case for adapting channel width in wireless networks
Found in: Proceedings of the ACM SIGCOMM 2008 conference on Data communication (SIGCOMM '08)
By Paramvir Bahl, Ramya Raghavendra, Ranveer Chandra, Ratul Mahajan, Thomas Moscibroda
Issue Date:August 2008
pp. 325
We study a fundamental yet under-explored facet in wireless communication -- the width of the spectrum over which transmitters spread their signals, or the channel width. Through detailed measurements in controlled and live environments, and using only com...
     
Local broadcasting in the physical interference model
Found in: Proceedings of the fifth international workshop on Foundations of mobile computing (DIAL M-POMC '08)
By Olga Goussevskaia, Roger Wattenhofer, Thomas Moscibroda
Issue Date:August 2008
pp. 1-2
In this work we analyze the complexity of local broadcasting in the physical interference model. We present two distributed randomized algorithms: one that assumes that each node knows how many nodes there are in its geographical proximity, and another, wh...
     
Distributed order scheduling and its application to multi-core dram controllers
Found in: Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing (PODC '08)
By Onur Mutlu, Thomas Moscibroda
Issue Date:August 2008
pp. 13-14
We study a distributed version of the order scheduling problem that arises when scheduling memory requests in shared DRAM systems of many-core architectures. In this problem, a set of n customer orders needs to be scheduled on multiple facilities. An order...
     
Allocating dynamic time-spectrum blocks in cognitive radio networks
Found in: Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing (MobiHoc '07)
By Paramvir Bahl, Ranveer Chandra, Thomas Moscibroda, Yuan Yuan, Yunnan Wu
Issue Date:September 2007
pp. 130-139
A number of studies have shown the abundance of unused spectrum in the TV bands. This is in stark contrast to the overcrowding of wireless devices in the ISM bands. A recent trend to alleviate this disparity is the design of Cognitive Radios, which constan...
     
Lottery trees: motivational deployment of networked systems
Found in: Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications (SIGCOMM '07)
By John R. Douceur, Thomas Moscibroda
Issue Date:August 2007
pp. 652-652
We address a critical deployment issue for network systems, namely motivating people to install and run a distributed service. This work is aimed primarily at peer-to-peer systems, in which the decision and effort to install a service falls to individuals ...
     
The worst-case capacity of wireless sensor networks
Found in: Proceedings of the 6th international conference on Information processing in sensor networks (IPSN '07)
By Thomas Moscibroda
Issue Date:April 2007
pp. 1-10
The key application scenario of wireless sensor networks is data gathering sensor nodes transmit data, possibly in a multi-hop fashion, to an information sink. The performance of sensor networks is thus characterized by the rate at which information can be...
     
On the topologies formed by selfish peers
Found in: Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing (PODC '06)
By Roger Wattenhofer, Stefan Schmid, Thomas Moscibroda
Issue Date:July 2006
pp. 133-142
Current peer-to-peer (P2P) systems often suffer from a large fraction of freeriders not contributing any resources to the network. Various mechanisms have been designed to overcome this problem. However, the selfish behavior of peers has aspects which go b...
     
When selfish meets evil: byzantine players in a virus inoculation game
Found in: Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing (PODC '06)
By Roger Wattenhofer, Stefan Schmid, Thomas Moscibroda
Issue Date:July 2006
pp. 35-44
Over the last years, game theory has provided great insights into the behavior of distributed systems by modeling the players as utility-maximizing agents. In particular, it has been shown that selfishness causes many systems to perform in a globally subop...
     
Topology control meets SINR:: the scheduling complexity of arbitrary topologies
Found in: Proceedings of the seventh ACM international symposium on Mobile ad hoc networking and computing (MobiHoc '06)
By Aaron Zollinger, Roger Wattenhofer, Thomas Moscibroda
Issue Date:May 2006
pp. 310-321
To date, topology control in wireless ad hoc and sensor networks--the study of how to compute from the given communication network a subgraph with certain beneficial properties .has been considered as a static problem only; the time required to actually sc...
     
The price of being near-sighted
Found in: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm (SODA '06)
By Fabian Kuhn, Roger Wattenhofer, Thomas Moscibroda
Issue Date:January 2006
pp. 980-989
Achieving a global goal based on local information is challenging, especially in complex and large-scale networks such as the Internet or even the human brain. In this paper, we provide an almost tight classification of the possible trade-off between the a...
     
Local approximation schemes for ad hoc and sensor networks
Found in: Proceedings of the 2005 joint workshop on Foundations of mobile computing (DIALM-POMC '05)
By Fabian Kuhn, Roger Wattenhofer, Thomas Moscibroda, Tim Nieberg
Issue Date:September 2005
pp. 97-103
We present two local approaches that yield polynomial-time approximation schemes (PTAS) for the Maximum Independent Set and Minimum Dominating Set problem in unit disk graphs. The algorithms run locally in each node and compute a (1+ε)-approximation t...
     
Minimizing interference in ad hoc and sensor networks
Found in: Proceedings of the 2005 joint workshop on Foundations of mobile computing (DIALM-POMC '05)
By Roger Wattenhofer, Thomas Moscibroda
Issue Date:September 2005
pp. 24-33
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds to the number of other nodes whose transmission range covers v. At the cost o...
     
Unit disk graph approximation
Found in: Proceedings of the 2004 joint workshop on Foundations of mobile computing (DIALM-POMC '04)
By Fabian Kuhn, Roger Wattenhofer, Thomas Moscibroda
Issue Date:October 2004
pp. 17-23
Finding a good embedding of a unit disk graph given by its connectivity information is a problem of practical importance in a variety of fields. In wireless ad hoc and sensor networks, such an embedding can be used to obtain virtual coordinates. In this pa...
     
Virtual coordinates for ad hoc and sensor networks
Found in: Proceedings of the 2004 joint workshop on Foundations of mobile computing (DIALM-POMC '04)
By Mirjam Wattenhofer, Regina O'Dell, Roger Wattenhofer, Thomas Moscibroda
Issue Date:October 2004
pp. 8-16
In many applications of wireless ad hoc and sensor networks, position-awareness is of great importance. Often, as in the case of geometric routing, it is sufficient to have virtual coordinates, rather than real coordinates. In this paper, we address the pr...
     
Initializing newly deployed ad hoc and sensor networks
Found in: Proceedings of the 10th annual international conference on Mobile computing and networking (MobiCom '04)
By Fabian Kuhn, Roger Wattenhofer, Thomas Moscibroda
Issue Date:September 2004
pp. 260-274
A newly deployed multi-hop radio network is unstructured and lacks a reliable and efficient communication scheme. In this paper, we take a step towards analyzing the problems existing during the initialization phase of ad hoc and sensor networks. Particula...
     
Brief announcement: efficient clustering in unstructured radio networks
Found in: Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing (PODC '04)
By Fabian Kuhn, Roger Wattenhofer, Thomas Moscibroda
Issue Date:July 2004
pp. 396-396
Secret handshake protocols were recently introduced by Balfanz, et al. [1] to allow members of the same group to authenticate each other secretly, in the sense that someone who is not a group member cannot tell, by engaging in the handshake protocol, wheth...
     
 1  2 Next >>