Filters








402 Hits in 2.3 sec

Ensuring Connectivity via Data Plane Mechanisms

Junda Liu, Aurojit Panda, Ankit Singla, Brighten Godfrey, Michael Schapira, Scott Shenker
2013 Symposium on Networked Systems Design and Implementation  
Our design, called Data-Driven Connectivity (DDC) ensures routing connectivity via data plane mechanisms.  ...  We typically think of network architectures as having two basic components: a data plane responsible for forwarding packets at line-speed, and a control plane that instantiates the forwarding state the  ...  Acknowledgments We are grateful to Shivaram Venkatraman, various reviewers, and our shepherd Dejan Kostic for their comments and suggestions.  ... 
dblp:conf/nsdi/LiuPSGSS13 fatcat:g6cqnplrz5cove7xb2fn3u7xj4

SHILL: A Secure Shell Scripting Language

Scott Moore, Christos Dimoulas, Dan King, Stephen Chong
2014 USENIX Symposium on Operating Systems Design and Implementation  
https://www.usenix.org/conference/osdi14/technical-sessions/presentation/moore USENIX Association 11th USENIX Symposium on Operating Systems Design and Implementation (OSDI '14) 183  ...  We are grateful to Leif Andersen, Vincent St-Amour, and Matthias Felleisen for their help profiling SHILL code.  ...  Acknowledgments We thank Dan Bradley for his contributions to an early version of this work, and Jennifer Kirk for her help with statistical analysis.  ... 
dblp:conf/osdi/MooreDKC14 fatcat:cehcqjlclvcfxoamhrvves2afy

The benefits and costs of writing a POSIX kernel in a high-level language

Cody Cutler, M. Frans Kaashoek, Robert Tappan Morris
2018 USENIX Symposium on Operating Systems Design and Implementation  
The goal is to explore if it is reasonable to use an HLL instead of C for such kernels, by examining performance costs, implementation challenges, and programmability and safety benefits.  ...  This paper presents an evaluation of the use of a high-level language (HLL) with garbage collection to implement a monolithic POSIX-style kernel.  ...  Acknowledgements We thank Nickolai Zeldovich, PDOS, Austin Clements, the anonymous reviewers, and our shepherd, Liuba Shrira, for their feedback. This research was supported by NSF award CSR-1617487.  ... 
dblp:conf/osdi/CutlerKM18 fatcat:db2kuxwngjeyvgonzjstv2kaiy

Design and implementation of aquaculture resource planning using underwater sensor wireless network

Shreema Shetty, Radhika M Pai, Manohara M. M. Pai, Kuei-Ping Shih
2018 Cogent Engineering  
The present system integrates WSN nodes to extract the data and connect to cloud data server.  ...  Aquaculture is a globally fast-growing food sector, and its economic significance is increasing consistently.  ...  Section 4 discusses the methodology and implementation with the activity diagram of designed web application. Section 5 presents results and discussion.  ... 
doi:10.1080/23311916.2018.1542576 fatcat:fl6b7rdmz5gufpe2fdc4urdqge

Design, implementation, and performance evaluation of a detection-based adaptive block replacement scheme

Jongmoo Choi, S.H. Noh, Sang Lyul Min, Eun-Yong Ha, Yookun Cho
2002 IEEE transactions on computers  
This paper also describes an implementation and performance measurement of the DEAR scheme in FreeBSD.  ...  The detection is made by a periodic process and is based on the relationship between block attribute values, such as backward distance and frequency gathered in a period, and the forward distance observed  ...  Without any help from the user or the compiler, the DEAR scheme dynamically detects the reference pattern of each application and classifies the pattern as sequential, looping, temporally clustered, or  ... 
doi:10.1109/tc.2002.1017699 fatcat:kzicjdnd4jddviqqooy6tcftla

A Simple and Practical Concurrent Non-blocking Unbounded Graph with Reachability Queries [article]

Bapi Chatterjee, Sathya Peri, Muktikanta Sa, Nandini Singhal
2019 arXiv   pre-print
Graph algorithms applied in many applications, including social networks, communication networks, VLSI design, graphics, and several others, require dynamic modifications -- addition and removal of vertices  ...  This paper presents a novel concurrent non-blocking algorithm to implement a dynamic unbounded directed graph in a shared-memory machine.  ...  ACKNOWLEDGEMENT We are grateful to Prasad Jayanti and the anonymous referees for pointing out related work and providing helpful comments.  ... 
arXiv:1809.00896v2 fatcat:vku7v32aezb3dlqzgbhuwhufh4

Rollerchain: A DHT for Efficient Replication

Joao Paiva, Joao Leitao, Luis Rodrigues
2013 2013 IEEE 12th International Symposium on Network Computing and Applications  
We have implemented a prototype of Rollerchain that we have used to experimentally validate its performance against other state of the art solutions.  ...  We have implemented a prototype of Rollerchain that we have used to experimentally validate its performance against other state of the art solutions. Abstract.  ...  Rollerchain Overview and Building Blocks Rollerchain dynamically manages the replication groups by combining features of unstructured and structured overlay networks in an integrated design.  ... 
doi:10.1109/nca.2013.29 dblp:conf/nca/PaivaLR13 fatcat:7solgbur6zedpabzdtofoopeoq

Integrated Management for Network Virtualization Infrastructure

Kazuhisa Yamada, Akihiro Nakao, Yasusi Kanada, Yoshinori Saida, Koichiro Amemiya
2016 Journal of NICT  
In addition, we proposed evolvable architecture and extended network virtualization for edge network and terminals. We also deployed our system on JGN-X testbed.  ...  This paper introduces research and development results of extended functions on our network virtualization infrastructure which achieve advanced network virtualization.  ...  Acknowledgments The authors acknowledge here that the research and  ... 
doi:10.24812/nictjournal.62.2_033 fatcat:5q4hlg7n2bbfxnvelzkwtd7t4m

Dynamic Graph Operations: A Consistent Non-blocking Approach [article]

Bapi Chatterjee and Sathya Peri and Muktikanta Sa
2020 arXiv   pre-print
Thus, the design and implementation of efficient concurrent dynamic graph algorithms have become significant.  ...  The presented algorithms are provably non-blocking and linearizable. We extensively evaluate C++ implementations of the algorithms through several micro-benchmarks.  ...  When required, we add/remove bucket-arrays for an unbounded resizable dynamic design. The lock-free VNode-lists have two sentinel VNodes: vh and vt initialized with keys -∞ and ∞, respectively.  ... 
arXiv:2003.01697v1 fatcat:xt3sxxcrljedpp6pcceccjg46q

File-system development with stackable layers

John S. Heidemann, Gerald J. Popek
1994 ACM Transactions on Computer Systems  
Independent l a yer evolution and development is supported by an extensible interface bounding each layer. This paper discusses stackable layering in detail and presents design techniques it enables.  ...  We describe an implementation providing these facilities that exhibits very high performance.  ...  We w ould like t o a c knowledge the contributions of Dieter Rothmeier, Wai Mak, David Ratner, Je Weidner, Peter Reiher, Steven Stovall, and Greg Skinner to the Ficus le system, and of Yu Guang Wu and  ... 
doi:10.1145/174613.174616 fatcat:wjesxmexrrbopmbj5zaj5s65rq

Design and implementation of the Trusted BSD MAC framework

R. Watson, B. Feldman, A. Migus, C. Vance
Proceedings DARPA Information Survivability Conference and Exposition  
We discuss the design and implementation of the framework, as well as the an implementation of a fixed-label Biba integrity policy based on the framework.  ...  The TrustedBSD MAC Framework permits extensions to be introduced at compiletime, boot-time, or at run-time, and provides a number of services to support dynamically introduced policies, including policy-agnostic  ...  Interfaces for user processes are defined in sys/mac.h, implemented in libc, and may be dynamically linked into any applications.  ... 
doi:10.1109/discex.2003.1194871 dblp:conf/discex/WatsonFMV03 fatcat:zxhxphrfwzdyzicel2wce4hyum

Extending File Systems Using Stackable Templates

Erez Zadok, Ion Badulescu, Alex Shender
1999 USENIX Annual Technical Conference  
This paper describes the design and implementation of Wrapfs, explores portability issues, and shows how the implementation was achieved without changing client file systems or operating systems.  ...  Impediments to writing new file systems include the complexity of operating systems, the difficulty of writing kernel-based code, the lack of a true stackable vnode interface [14], and the challenges of  ...  We would also like to thank Fred Korz, Seth Robertson, Jerry Altzman, and especially Dan Duchamp for their help in reviewing this paper and offering concrete suggestions.  ... 
dblp:conf/usenix/ZadokBS99 fatcat:wmpwxgabsnha5bvjs33yqz3d6m

Domus – An Architecture for Cluster-Oriented Distributed Hash Tables [chapter]

José Rufino, António Pina, Albano Alves, José Exposto
2006 Lecture Notes in Computer Science  
The design, at each cluster node, and for each DHT, also takes advantage of the strict separation of object lookup and storage.  ...  Two basic units of balancement are supported: vnodes, a coarse-grain unit, and partitions, a fine-grain unit.  ...  Vnodes and partitions relate as follows: for each one of its vnodes, a node will be given a certain number of partitions; this number is dynamically adjustable so that, for every cluster node n enrolled  ... 
doi:10.1007/11752578_36 fatcat:cjq7j6k2yveszb3hym6xe3hqua

The Virtual Filesystem Interface in 4.4BSD

Marshall K. McKusick
1995 Computing Systems  
After describing the stacking functionality, several examples of stacking filesystems are shown. t To appear in The Design and Implementation of the 4.4BSD Operating System, by Marshall Kirk McKusick,  ...  The vnode structure is described along with its method for dynamically expanding its set of operations.  ...  Unlike the original Sun Microsystems vnode implementation,4.4BSD allows dynamic addition of vnode operations at system boot time.  ... 
dblp:journals/csys/McKusick95 fatcat:423k3igx7zh2pfowhocai4fefq

Performance of cache coherence in stackable filing

J. Heidemann, G. Popek
1995 Proceedings of the fifteenth ACM symposium on Operating systems principles - SOSP '95  
Without a cache coherence solution, layer designers must either restrict layer access and flexibility or compromise the layered structure to avoid potential data corruption.  ...  We also present a detailed performance analysis of one implementation of stack cache-coherence, which suggests that very low overheads can be achieved in practice.  ...  Acknowledgments The authors thank the anonymous reviewers and Greg Minshall, our paper shepherd, whose comments significantly improved this paper.  ... 
doi:10.1145/224056.224067 dblp:conf/sosp/HeidemannP95 fatcat:5fzm5fwznfeehijqd6ospxnfbi
« Previous Showing results 1 — 15 out of 402 results