Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Physical Sciences and Mathematics (698)
- Computer Sciences (697)
- Electrical and Computer Engineering (15)
- Computer and Systems Architecture (10)
- Electrical and Electronics (8)
-
- Hardware Systems (4)
- Digital Communications and Networking (3)
- Other Computer Engineering (3)
- Other Electrical and Computer Engineering (3)
- Robotics (3)
- Signal Processing (2)
- VLSI and Circuits, Embedded and Hardware Systems (2)
- Artificial Intelligence and Robotics (1)
- Biochemical and Biomolecular Engineering (1)
- Biomedical Engineering and Bioengineering (1)
- Chemical Engineering (1)
- Civil and Environmental Engineering (1)
- Controls and Control Theory (1)
- Digital Circuits (1)
- Environmental Engineering (1)
- Numerical Analysis and Scientific Computing (1)
- Optics (1)
- Physics (1)
- Software Engineering (1)
- Systems Architecture (1)
- Systems and Communications (1)
- Theory and Algorithms (1)
- Keyword
-
- FPGA (4)
- Machine learning (3)
- ADAPT (2)
- Algorithms (2)
- Distributed Embedded Systems (2)
-
- Logic simulation (2)
- OpenCL (2)
- Optimization (2)
- Polarization (2)
- Real-Time Middleware (2)
- AHE (1)
- AI (1)
- ASIC (1)
- Adaptive and reflective middleware (1)
- Adaptive denoiser (1)
- Adaptive real-time image transmission. (1)
- Adversarial Attacks (1)
- Adversarial Machine Learning (1)
- Adversarial Robustness (1)
- Aerosol size distribution (1)
- Analog Sensor (1)
- Anytime algorithms (1)
- Application-Specific Integrated Circuits (1)
- Artificial Intelligence Secure Framework;Distributed 5G Testbed;Hybrid Deep Reinforcement Learning (HDRL);Internet of Medical Things (IoMT);Internet of Things (IoT);LEMDA (1)
- Artificial Neural Network (1)
- Authentication (1)
- Automaton (1)
- Autonomous System (1)
- Autonomy (1)
- Beat Analysis (1)
- Publication Year
- Publication
- Publication Type
Articles 61 - 90 of 733
Full-Text Articles in Computer Engineering
In-Network Retransmissions In Named Data Networking, Hila Ben Abraham, Patrick Crowley
In-Network Retransmissions In Named Data Networking, Hila Ben Abraham, Patrick Crowley
All Computer Science and Engineering Research
The strategy layer is an important architectural component in both Content-Centric Networking (CCN) and Named Data Networking (NDN). This component introduces a new forwarding model that allows an application to configure its namespace with a forwarding strategy. A core mechanism in every forwarding strategy is the decision of whether to retransmit an unsatisfied Interest or to wait for an application retransmission. While some applications request control of all retransmissions, others rely on the assumption that the strategy will retransmit an Interest when it is not satisfied. Although an application can select the forwarding strategy used in the local host, it …
Grafalgo - A Library Of Graph Algorithms And Supporting Data Structures (Revised), Jonathan Turner
Grafalgo - A Library Of Graph Algorithms And Supporting Data Structures (Revised), Jonathan Turner
All Computer Science and Engineering Research
This report provides an (updated) overview of Grafalgo, an open-source library of graph algorithms and the data structures used to implement them. The programs in this library were originally written to support a graduate class in advanced data structures and algorithms at Washington University. Because the code's primary purpose was pedagogical, it was written to be as straightforward as possible, while still being highly efficient. Grafalgo is implemented in C++ and incorporates some features of C++11. The library is available on an open-source basis and may be downloaded from https://code.google.com/p/grafalgo/. Source code documentation is at www.arl.wustl.edu/~jst/doc/grafalgo.
Locality-Aware Dynamic Task Graph Scheduling, Jordyn Maglalang, Sriram Krishnamoorthy, Kunal Agrawal
Locality-Aware Dynamic Task Graph Scheduling, Jordyn Maglalang, Sriram Krishnamoorthy, Kunal Agrawal
All Computer Science and Engineering Research
Dynamic task graph schedulers automatically balance work across processor cores by scheduling tasks among available threads while preserving dependences. In this paper, we design NabbitC, a provably efficient dynamic task graph scheduler that accounts for data locality on NUMA systems. NabbitC allows users to assign a color to each task representing the location (e.g., a processor core) that has the most efficient access to data needed during that node’s execution. NabbitC then automatically adjusts the scheduling so as to preferentially execute each node at the location that matches its color—leading to better locality because the node is likely to make …
Faster Maximium Priority Matchings In Bipartite Graphs, Jonathan Turner
Faster Maximium Priority Matchings In Bipartite Graphs, Jonathan Turner
All Computer Science and Engineering Research
A maximum priority matching is a matching in an undirected graph that maximizes a priority score defined with respect to given vertex priorities. An earlier paper showed how to find maximum priority matchings in unweighted graphs. This paper describes an algorithm for bipartite graphs that is faster when the number of distinct priority classes is limited. For graphs with k distinct priority classes it runs in O(kmn1/2) time, where n is the number of vertices in the graph and m is the number of edges.
The Bounded Edge Coloring Problem And Offline Crossbar Scheduling, Jonathan Turner
The Bounded Edge Coloring Problem And Offline Crossbar Scheduling, Jonathan Turner
All Computer Science and Engineering Research
This paper introduces a variant of the classical edge coloring problem in graphs that can be applied to an offline scheduling problem for crossbar switches. We show that the problem is NP-complete, develop three lower bounds bounds on the optimal solution value and evaluate the performance of several approximation algorithms, both analytically and experimentally. We show how to approximate an optimal solution with a worst-case performance ratio of 3/2 and our experimental results demonstrate that the best algorithms produce results that very closely track a lower bound.
Maximum Priority Matchings, Jonathan Turner
Maximum Priority Matchings, Jonathan Turner
All Computer Science and Engineering Research
Let G=(V,E) be an undirected graph with n vertices and m edges, in which each vertex u is assigned an integer priority in [1,n], with 1 being the ``highest'' priority. Let M be a matching of G. We define the priority score of M to be an n-ary integer in which the i-th most-significant digit is the number of vertices with priority i that are incident to an edge in M. We describe a variation of the augmenting path method (Edmonds' algorithm) that finds a matching with maximum priority score in O(mn) time.
Conflict-Aware Real-Time Routing For Industrial Wireless Sensor-Actuator Networks, Chengjie Wu, Dolvara Gunatilaka, Mo Sha, Chenyang Lu
Conflict-Aware Real-Time Routing For Industrial Wireless Sensor-Actuator Networks, Chengjie Wu, Dolvara Gunatilaka, Mo Sha, Chenyang Lu
All Computer Science and Engineering Research
Process industries are adopting wireless sensor-actuator networks (WSANs) as the communication infrastructure. WirelessHART is an open industrial standard for WSANs that have seen world-wide deployments. Real-time scheduling and delay analysis have been studied for WSAN extensively. End-to-end delay in WSANs highly depends on routing, which is still open problem. This paper presents the first real-time routing design for WSAN. We first discuss end-to-end delays of WSANs, then present our real-time routing design. We have implemented and experimented our routing designs on a wireless testbed of 69 nodes. Both experimental results and simulations show that our routing design can improve the …
Maximizing Network Lifetime Of Wireless Sensor-Actuator Networks Under Graph Routing, Chengjie Wu, Dolvara Gunatilaka, Abusayeed Saifullah, Mo Sha, Paras Tiwari, Chenyang Lu, Yixin Chen
Maximizing Network Lifetime Of Wireless Sensor-Actuator Networks Under Graph Routing, Chengjie Wu, Dolvara Gunatilaka, Abusayeed Saifullah, Mo Sha, Paras Tiwari, Chenyang Lu, Yixin Chen
All Computer Science and Engineering Research
Process industries are adopting wireless sensor-actuator networks (WSANs) as the communication infrastructure. The dynamics of industrial environments and stringent reliability requirements necessitate high degrees of fault tolerance in routing. WirelessHART is an open industrial standard for WSANs that have seen world-wide deployments. WirelessHART employs graph routing schemes to achieve network reliability through multiple paths. Since many industrial devices operate on batteries in harsh environments where changing batteries are prohibitively labor-intensive, WSANs need to achieve long network lifetime. To meet industrial demand for long-term reliable communication, this paper studies the problem of maximizing network lifetime for WSANs under graph routing. We …
Woodstocc: Extracting Latent Parallelism From A Dna Sequence Aligner On A Gpu, Stephen V. Cole, Jacob R. Gardner, Jeremy D. Buhler
Woodstocc: Extracting Latent Parallelism From A Dna Sequence Aligner On A Gpu, Stephen V. Cole, Jacob R. Gardner, Jeremy D. Buhler
All Computer Science and Engineering Research
An exponential increase in the speed of DNA sequencing over the past decade has driven demand for fast, space-efficient algorithms to process the resultant data. The first step in processing is alignment of many short DNA sequences, or reads, against a large reference sequence. This work presents WOODSTOCC, an implementation of short-read alignment designed for Graphics Processing Unit (GPU) architectures. WOODSTOCC translates a novel CPU implementation of gapped short-read alignment, which has guaranteed optimal and complete results, to the GPU. Our implementation combines an irregular trie search with dynamic programming to expose regularly structured parallelism. We first describe this implementation, …
The Edge Group Coloring Problem With Applications To Multicast Switching, Jonathan Turner
The Edge Group Coloring Problem With Applications To Multicast Switching, Jonathan Turner
All Computer Science and Engineering Research
This paper introduces a natural generalization of the classical edge coloring problem in graphs that provides a useful abstraction for two well-known problems in multicast switching. We show that the problem is NP-hard and evaluate the performance of several approximation algorithms, both analytically and experimentally. We find that for random χ-colorable graphs, the number of colors used by the best algorithms falls within a small constant factor of χ, where the constant factor is mainly a function of the ratio of the number of outputs to inputs. When this ratio is less than 10, the best algorithms produces solutions that …
Grafalgo - A Library Of Graph Algorithms And Supporting Data Structures, Jonathan Turner
Grafalgo - A Library Of Graph Algorithms And Supporting Data Structures, Jonathan Turner
All Computer Science and Engineering Research
This report provides an overview of Grafalgo, an open-source library of graph algorithms and the data structures used to implement them. The programs in this library were originally written to support a graduate class in advanced data structures and algorithms at Washington University. Because the code's primary purpose was pedagogical, it was written to be as straightforward as possible, while still being highly efficient. Grafalgo is implemented in C++ and incorporates some features of C++11. The library is available on an open-source basis and may be downloaded from https://code.google.com/p/grafalgo/. Source code documentation is at www.arl.wustl.edu/~jst/doc/grafalgo. While not designed as production …
Data Transport System, Rahav Dor
Data Transport System, Rahav Dor
All Computer Science and Engineering Research
To facilitate the WU Smart Home research [21] we built a system that collects data from sensors and uploads the data to the cloud. The system supports data collection from multiple locations (typically apartments) that are independent from each other, endowing the system with two benefit: distributed data collection and alleviating privacy concerns. Each location is managed by a local micro-server (μServer) that is responsible for receiving data packets from sensors and managing their transient storage. Periodically the μServer triggers a data transport process that moves the data to a cloud server where it is stored in a centralized database. …
Exploring User-Provided Connectivity, Mohammad H. Afrasiabi, Roch Guerin
Exploring User-Provided Connectivity, Mohammad H. Afrasiabi, Roch Guerin
All Computer Science and Engineering Research
Network services often exhibit positive and negative externalities that affect users' adoption decisions. One such service is "user-provided connectivity" or UPC. The service offers an alternative to traditional infrastructure-based communication services by allowing users to share their "home base" connectivity with other users, thereby increasing their access to connectivity. More users mean more connectivity alternatives, i.e., a positive externality, but also greater odds of having to share one's own connectivity, i.e., a negative externality. The tug of war between positive and negative externalities together with the fact that they often depend not just on how many but also which users …
Migrating To Ipv6 - The Role Of Basic Coordination, Mehdi Nikkhah, Roch Guerin
Migrating To Ipv6 - The Role Of Basic Coordination, Mehdi Nikkhah, Roch Guerin
All Computer Science and Engineering Research
The need for a larger Internet address space was acknowledged early on, and a solution (IPv6) standardized years ago. Its adoption has, however, been anything but easy and still faces significant challenges. The situation begs the questions of "why has it been so difficult?" and "what could have been (or still be) done to facilitate this migration?" There has been significant recent interest in those questions, and the paper builds on a line of work based on technology adoption models to explore them. The results confirm the impact of several known factors, but also provide new insight. In particular, they …
Global Edf Scheduling For Parallel Real-Time Tasks, Jing Li
Global Edf Scheduling For Parallel Real-Time Tasks, Jing Li
McKelvey School of Engineering Graduate Student Theses & Dissertations
As multicore processors become ever more prevalent, it is important for real-time programs to take advantage of intra-task parallelism in order to support computation-intensive applications with tight deadlines. In this thesis, we consider the Global Earliest Deadline First (GEDF) scheduling policy for task sets consisting of parallel tasks. Each task can be represented by a directed acyclic graph (DAG) where nodes represent computational work and edges represent dependences between nodes. In this model, we prove that GEDF provides a capacity augmentation bound of 4-2/m and a resource augmentation bound of 2-1/m. The capacity augmentation bound acts as a linear-time schedulability …
Federated Scheduling For Stochastic Parallel Real-Time Tasks, Jing Li, Kunal Agrawal, Christopher Gill, Chenyang Lu
Federated Scheduling For Stochastic Parallel Real-Time Tasks, Jing Li, Kunal Agrawal, Christopher Gill, Chenyang Lu
All Computer Science and Engineering Research
Federated scheduling is a strategy to schedule parallel real-time tasks: It allocates a dedicated cluster of cores to high-utilization task (utilization >1); It uses a multiprocessor scheduling algorithm to schedule and execute all low-utilization tasks sequentially, on a shared cluster of the remaining cores. Prior work has shown that federated scheduling has the best known capacity augmentation bound of 2 for parallel tasks with implicit deadlines. In this paper, we explore the soft real-time performance of federated scheduling and address the average-case workloads instead of the worst-case values. In particular, we consider stochastic tasks -- tasks for which execution time …
Inferring Memory Map Instructions, Paul T. Scheid, Ari J. Spilo, Ron K. Cytron
Inferring Memory Map Instructions, Paul T. Scheid, Ari J. Spilo, Ron K. Cytron
All Computer Science and Engineering Research
We describe the problem of inferring a set of memory map instructions from a reference trace, with the goal of minimizing the number of such instructions as well as the number of unreferenced but mapped storage locations. We prove the related decision problem NP-complete. We then present and compare the results of two heuristic approaches on some actual traces.
Capacity Augmentation Bound Of Federated Scheduling For Parallel Dag Tasks, Jing Li, Abusayeed Saifullah, Kunal Agrawal, Christopher Gill
Capacity Augmentation Bound Of Federated Scheduling For Parallel Dag Tasks, Jing Li, Abusayeed Saifullah, Kunal Agrawal, Christopher Gill
All Computer Science and Engineering Research
We present a novel federated scheduling approach for parallel real-time tasks under a general directed acyclic graph (DAG) model. We provide a capacity augmentation bound of 2 for hard real-time scheduling; here we use the worst-case execution time and critical-path length of tasks to determine schedulability. This is the best known capacity augmentation bound for parallel tasks. By constructing example task sets, we further show that the lower bound on capacity augmentation of federated scheduling is also 2 for any m > 2. Hence, the gap is closed and bound 2 is a strict bound for federated scheduling. The federated scheduling …
Performance Modeling Of Virtualized Custom Logic Computations, Michael J. Hall, Roger D. Chamberlain
Performance Modeling Of Virtualized Custom Logic Computations, Michael J. Hall, Roger D. Chamberlain
All Computer Science and Engineering Research
Virtualization of custom logic computations (i.e., by sharing a fixed function across distinct data streams) provides a means of reusing hardware resources, particularly when resources are limited. This is common practice in traditional processors where more than one user can share processor resources. In this paper, we virtualize a custom logic block using C-slow techniques to support fine-grain context-switching. We then develop and present an analytic model for several performance measures (throughput, latency, input queue occupancy) for both fine-grained and coarse-grained context switching (to a secondary memory). Next, we calibrate the analytic performance model with empirical measurements. We then validate …
Rt-Openstack: A Real-Time Cloud Management System, Sisu Xi, Chong Li, Chenyang Lu, Christopher D. Gill, Meng Xu, Linh T.X. Phan, Insup Lee, Oleg Sokolsky
Rt-Openstack: A Real-Time Cloud Management System, Sisu Xi, Chong Li, Chenyang Lu, Christopher D. Gill, Meng Xu, Linh T.X. Phan, Insup Lee, Oleg Sokolsky
All Computer Science and Engineering Research
Clouds have become appealing platforms for running not only general-purpose applications but also real-time applications. However, current clouds cannot provide real-time performance for virtual machines (VM) for two reasons: (1) the lack of a real-time virtual machine monitor (VMM) scheduler on a single host, and (2) the lack of a real-time aware VM placement scheme by the cloud manager. While real-time VM schedulers do exist, prior solutions employ either heuristics-based approaches that cannot always achieve predictable latency or apply real-time scheduling theory that may result in low CPU utilization. We observe the demand and advantage for co-hosting real-time (RT) VMs …
Streaming Computations With Precise Control, Peng Li, Kunal Agrawal, Jeremy Buhler, Roger Chamberlain
Streaming Computations With Precise Control, Peng Li, Kunal Agrawal, Jeremy Buhler, Roger Chamberlain
All Computer Science and Engineering Research
No abstract provided.
Cloudpowercap: Integrating Power Budget And Resource Management Across A Virtualized Server Cluster, Yong Fu, Anne Holler, Chenyang Lu
Cloudpowercap: Integrating Power Budget And Resource Management Across A Virtualized Server Cluster, Yong Fu, Anne Holler, Chenyang Lu
All Computer Science and Engineering Research
In many datacenters, server racks are highly underutilized. Rack slots are left empty to keep the sum of the server nameplate maximum power below the power provisioned to the rack. And the servers that are placed in the rack cannot make full use of available rack power. The root cause of this rack underutilization is that the server nameplate power is often much higher than can be reached in practice. To address rack underutilization, server vendors are shipping support for per-host power caps, which provide a server-enforced limit on the amount of power that the server can draw. Using this …
End-To-End Delay Analysis For Wireless Control Networks Under Edf Scheduling, Chengjie Wu
End-To-End Delay Analysis For Wireless Control Networks Under Edf Scheduling, Chengjie Wu
All Theses and Dissertations (ETDs)
No abstract provided.
Wireless Cyber-Physical Simulator And Case Studies On Structural Control, Bo Li
Wireless Cyber-Physical Simulator And Case Studies On Structural Control, Bo Li
All Theses and Dissertations (ETDs)
No abstract provided.
Difficulties And Opportunities In Building Resilient Clinical Monitoring Systems With Wireless Sensor Networks, Rahav Dor
All Theses and Dissertations (ETDs)
No abstract provided.
Delivering Consistent Network Performance In Multi-Tenant Data Centers, Mart Albert Haitjema
Delivering Consistent Network Performance In Multi-Tenant Data Centers, Mart Albert Haitjema
All Theses and Dissertations (ETDs)
Data centers are growing rapidly in size and have recently begun acquiring a new role as cloud hosting platforms, allowing outside developers to deploy their own applications on large scales. As a result, today's data centers are multi-tenant environments that host an increasingly diverse set of applications, many of which have very demanding networking requirements. This has prompted research into new data center architectures that offer increased capacity by using topologies that introduce multiple paths between servers. To achieve consistent network performance in these networks, traffic must be effectively load balanced among the available paths. In addition, some form of …
Kernel Density Metric Learning, Yujie He, Wenlin Chen, Yixin Chen
Kernel Density Metric Learning, Yujie He, Wenlin Chen, Yixin Chen
All Computer Science and Engineering Research
This paper introduces a supervised metric learning algorithm, called kernel density metric learning (KDML), which is easy to use and provides nonlinear, probability-based distance measures. KDML constructs a direct nonlinear mapping from the original input space into a feature space based on kernel density estimation. The nonlinear mapping in KDML embodies established distance measures between probability density functions, and leads to correct classification on datasets for which linear metric learning methods would fail. Existing metric learning algorithms, such as large margin nearest neighbors (LMNN), can then be applied to the KDML features to learn a Mahalanobis distance. We also propose …
Parallel Real-Time Scheduling Of Dags, Abusayeed Saifullah, David Ferry, Jing Li, Kunal Agrawal, Chenyang Lu, Christopher Gill
Parallel Real-Time Scheduling Of Dags, Abusayeed Saifullah, David Ferry, Jing Li, Kunal Agrawal, Chenyang Lu, Christopher Gill
All Computer Science and Engineering Research
Recently, multi-core processors have become mainstream in processor design. To take full advantage of multi-core processing, computation-intensive real-time systems must exploit intra-task parallelism. In this paper, we address the open problem of real-time scheduling for a general model of deterministic parallel tasks, where each task is represented as a directed acyclic graph (DAG) with nodes having arbitrary execution requirements. We prove processor-speed augmentation bounds for both preemptive and non-preemptive real-time scheduling for general DAG tasks on multi-core processors. We first decompose each DAG into sequential tasks with their own release times and deadlines. Then we prove that these decomposed tasks …
Scanner: An Efficient And Accurate Trimming Tool For Illumina Next Generation Sequencing Reads, Xiang Zhou
Scanner: An Efficient And Accurate Trimming Tool For Illumina Next Generation Sequencing Reads, Xiang Zhou
All Computer Science and Engineering Research
Recent advances in High-Throughput Sequencing (HTS) technology have greatly facilitated the researches in bioinformatics field. With the ultra-high sequencing speed and improved base-calling accuracy, Illumina Genome Analyzer is currently the most widely used platform in the field. To use the raw reads generated from the sequencing machine, the 3’ adapter sequence attached to the real read in the process of ligation needs to be correctly trimmed. This is often done by some inhouse scripts or different packages with various parameters. They either use the Smith-Waterman algorithm or search for an exact match of the 3’ adapter sequence. In this report, …
Simple Analytic Performance Models For Streaming Data Applications Deployed On Diverse Architectures, Jonathan C. Beard, Roger D. Chamberlain, Mark A. Franklin
Simple Analytic Performance Models For Streaming Data Applications Deployed On Diverse Architectures, Jonathan C. Beard, Roger D. Chamberlain, Mark A. Franklin
All Computer Science and Engineering Research
Modern hardware is inherently heterogeneous. With heterogeneity comes multiple abstraction layers that hide underlying complex systems. While hidden, this complexity makes quantitative performance modeling a difficult task. Designers of high-performance streaming applications for heterogeneous systems must contend with unpredictable and often non-generalizable models to predict performance of a particular application and hardware mapping. This paper outlines a computationally simple approach that can be used to model the overall throughput and buffering needs of a streaming application on heterogeneous hardware. The model presented is based upon a hybrid maximum flow and decomposed discrete queueing model. The utility of the model is …