11,611 research outputs found
Control dependence for extended finite state machines
Though there has been nearly three decades of work on program slicing, there has been comparatively little work on slicing for state machines. One of the primary challenges that currently presents a barrier to wider application of state machine slicing is the problem of determining control dependence. We survey existing related definitions, introducing a new definition that subsumes one and extends another. We illustrate that by using this new definition our slices respect Weiser slicingās termination behaviour. We prove results that clarify the relationships between our definition and older ones, following this up with examples to motivate the need for these differences
Enabling RAN Slicing Through Carrier Aggregation in mmWave Cellular Networks
The ever increasing number of connected devices and of new and heterogeneous
mobile use cases implies that 5G cellular systems will face demanding technical
challenges. For example, Ultra-Reliable Low-Latency Communication (URLLC) and
enhanced Mobile Broadband (eMBB) scenarios present orthogonal Quality of
Service (QoS) requirements that 5G aims to satisfy with a unified Radio Access
Network (RAN) design. Network slicing and mmWave communications have been
identified as possible enablers for 5G. They provide, respectively, the
necessary scalability and flexibility to adapt the network to each specific use
case environment, and low latency and multi-gigabit-per-second wireless links,
which tap into a vast, currently unused portion of the spectrum. The
optimization and integration of these technologies is still an open research
challenge, which requires innovations at different layers of the protocol
stack. This paper proposes to combine them in a RAN slicing framework for
mmWaves, based on carrier aggregation. Notably, we introduce MilliSlice, a
cross-carrier scheduling policy that exploits the diversity of the carriers and
maximizes their utilization, thus simultaneously guaranteeing high throughput
for the eMBB slices and low latency and high reliability for the URLLC flows.Comment: 8 pages, 8 figures. Proc. of the 18th Mediterranean Communication and
Computer Networking Conference (MedComNet 2020), Arona, Italy, 202
Amorphous slicing of extended finite state machines
Slicing is useful for many Software Engineering applications and has been widely studied for three decades, but there has been comparatively little work on slicing Extended Finite State Machines (EFSMs). This paper introduces a set of dependency based EFSM slicing algorithms and an accompanying tool. We demonstrate that our algorithms are suitable for dependence based slicing. We use our tool to conduct experiments on ten EFSMs, including benchmarks and industrial EFSMs. Ours is the first empirical study of dependence based program slicing for EFSMs. Compared to the only previously published dependence based algorithm, our average slice is smaller 40% of the time and larger only 10% of the time, with an average slice size of 35% for termination insensitive slicing
Analysis and Evaluation of Processes and Equipment in Tasks 2 and 4 of the Low-cost Solar Array Project
The significant economic data for the current production multiblade wafering and inner diameter slicing processes were tabulated and compared to data on the experimental and projected multiblade slurry, STC ID diamond coated blade, multiwire slurry and crystal systems fixed abrasive multiwire slicing methods. Cost calculations were performed for current production processes and for 1982 and 1986 projected wafering techniques
A Story of Parametric Trace Slicing, Garbage and Static Analysis
This paper presents a proposal (story) of how statically detecting
unreachable objects (in Java) could be used to improve a particular runtime
verification approach (for Java), namely parametric trace slicing. Monitoring
algorithms for parametric trace slicing depend on garbage collection to (i)
cleanup data-structures storing monitored objects, ensuring they do not become
unmanageably large, and (ii) anticipate the violation of (non-safety)
properties that cannot be satisfied as a monitored object can no longer appear
later in the trace. The proposal is that both usages can be improved by making
the unreachability of monitored objects explicit in the parametric property and
statically introducing additional instrumentation points generating related
events. The ideas presented in this paper are still exploratory and the
intention is to integrate the described techniques into the MarQ monitoring
tool for quantified event automata.Comment: In Proceedings PrePost 2017, arXiv:1708.0688
- ā¦