Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Glenn Ricart

dblp:54/1042 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
0since 2021 · last 2020
0000-0001-6471-8546ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 2 · 1 first-authorSystems, architecture and hardware · 1Software engineering, systems software and programming languages · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
4 papers
Cloud and datacenter computing · 53% Embedded and real-time systems · 30% Distributed systems · 16%
Computer networks
1 paper
Internet of things and sensor networks · 100%
Theoretical computer science
1 paper
Information theory · 100%

Topics — the 9 heaviest of 12, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Embedded and real-time systems › real-time communication › real-time networks
time-sensitive networking
0.412020
Invited Paper: Perishable Data in Smart Communities · ICNP 2020
Cloud and datacenter computing
cluster resource management and scheduling
0.412019
The Design and Operation of CloudLab · USENIX ATC 2019
Cloud and datacenter computing
edge and fog computing
0.412019
The EdgeNet System · ICNP 2019
Information theory › information measures › entropy
shannon entropy
0.112020
Invited Paper: Perishable Data in Smart Communities · ICNP 2020
Distributed systems
experimental testbed
0.112019
The Design and Operation of CloudLab · USENIX ATC 2019
Distributed systems › distributed system architecture
geo-distributed systems
0.112019
The EdgeNet System · ICNP 2019
Interconnection networks and networks-on-chip › routing algorithms
adaptive routing
0.011982
Adaptive Routing Using a Virtual Waiting Time Technique · IEEE Trans. Software Eng. 1982
Distributed systems
distributed scheduling
0.011982
Adaptive Routing Using a Virtual Waiting Time Technique · IEEE Trans. Software Eng. 1982
Parallel and multicore computing
load balancing
0.011982
Adaptive Routing Using a Virtual Waiting Time Technique · IEEE Trans. Software Eng. 1982

Methods — techniques the papers use, named apart from their topics

information theory · 1.3cross-layer coordination · 1.3site-driven deployment · 0.4open-source software stack · 0.4virtual waiting time · 0.0queueing analysis · 0.0
YearPublicationVenuePosition
2020 Invited Paper: Perishable Data in Smart Communities
abstract
Distributed smart and connected community applications of the present and future will continuously sense perishable data on which they make decisions. We say the data are perishable when they represent information sensed at a past point in time, possibly at a distant part of the distributed application, and for which the ground truth could have since changed. This paper discusses actions the sensing source, the network, and the controller can take to make the best possible decisions given that we know only a delayed version of the truth. Some of these actions to preserve freshness of data are based on known real-time techniques such as Time Sensitive Networking. To these we add Information Theory applied on a message-by-message basis and cross-layer coordination between content and network handling. Both the unexpectedness (surprisal) and timeliness (freshness) properties of perishable information can be encoded using a Shannon information entropy framework. Examples of smart community systems of the future for which these concepts are relevant are given.
Glenn Ricart
ICNP1
2019 The EdgeNet System
abstract
EdgeNet is the prototype of a scalable, sustainable general-purpose testbed for very wide area distributed systems and extremely low-latency distributed services. In this, it is aimed at the same experimenters and systems that formed the core usage of previous, highly-successful wide-area testbeds such as PlanetLab [1], G-Lab [2], V-Node [5], GENI [4], and SAVI [3], and it incorporates many of the features that characterized those previous testbeds. EdgeNet's goal is to achieve the usability and research value of the previous generations of wide area testbed, whilst offering radical improvements in the scalability and sustainability of those systems. It achieves this scalability and sustainability through a strategy of using industry-standard open-source software as the basis of its software stack, and by a strategy of hardwarefree, bottom-up, site-driven deployment. EdgeNet follows the Seattle [6] and PlanetIgnite [9] strategy of permitting sites to join the testbed with purely local action.
Timur Friedman, Rick McGeer, Berat Can Senel, Matt Hemmings, Glenn Ricart
ICNP5
2019 The Design and Operation of CloudLab
Dmitry Duplyakin, Robert Ricci, Aleksander Maricq, Gary Wong, Jonathon Duerig, Eric Eide, Leigh Stoller, Mike Hibler, David Johnson 0004, Kirk Webb, Aditya Akella, Kuang-Ching Wang, Glenn Ricart, Lawrence H. Landweber, Chip Elliott, Michael Zink, Emmanuel Cecchet, Snigdhaswin Kar, Prabodh Mishra
USENIX ATC13
2015 The Ignite Distributed Collaborative Scientific Visualization System
abstract
We describe the Ignite Distributed Collaborative Scientific Visualization System (IDCVS), a system which permits real-time interaction and visual collaboration around large data sets, with an initial emphasis on scientific data. The IDCVS offers such a collaborative environment, with real-time interaction on any device between users separated across the wide area. It provides seamless interaction and immediate updates even under heavy load and when users are widely separated: the design goal was to fetch a data set consisting of 30,000 points from a server and render it within 150ms, for a user anywhere in the world, and reflect changes made by a user in one location to all other users within a bound provided by network latency. The system was demonstrated successfully on a significant worldwide air pollution data set, with values on 10, 25, 50, and 100km worldwide grids, monthly over an 18-year period. It was demonstrated on a wide variety of clients, including laptop, tablet, and smartphone.
Sushil Bhojwani, Matt Hemmings, Daniel H. H. Ingalls, Jens Lincke, Robert Krahn, David John Lary, Patrick C. McGeer, Glenn Ricart, Marko Röder, Yvonne Coady, Ulrike Stege
CloudCom8
1982 Adaptive Routing Using a Virtual Waiting Time Technique
abstract
The virtual waiting time technique is introduced as a solution to the problem of a controller distributing work to servers of different speeds. The servers are considered to be part of a distributed system without feedback. The virtual waiting time technique is shown to minimize the average completion time for a job distributed by the controller. The virtual waiting time technique does not depend on any arrival distribution and is applicable to any service time distribution. The performance of the technique is examined for different arrival and service time distributions.
Ashok K. Agrawala, Satish K. Tripathi, Glenn Ricart
IEEE Trans. Software Eng.3