Minimize Access Time Research Articles

A CNTFET based stable, single-ended 7T SRAM cell with improved write operation

Many researchers are working to improve the write operation in SRAM bit-cell for better write stability, low power dissipation, and minimal access time during the write process. However, the read and hold operation parameters should not be compromised to achieve these improvements. This paper presents a stable single-ended seven-carbon nanotube field-effect transistor (CNTFET) driven SRAM cell with improved write operation. The one-side inverter weakening approach for write and transistor decoupling for read operation leads to reduced dynamic power, low write delay, reduced leakage power, and improved stability. The proposed design is compared with conventional 6T (Conv6T) and three recently proposed designs, i.e., feedback-cutting 8T (feed-cut 8T), Low-power 8T and low-leakage 7T cell. The write delay and write PDP of the proposed design improve by 4.05×/3.58×/1.19×/1.21×and 11.11×/24.71×/2.96×/3.32×, respectively, compared to Conv6T/feed-cut 8T/ low-power 8T/ low-leakage 7T. Also, the read delay and read PDP of the proposed design improve by 1×/1.03×/1.72×/1.56× and 1×/1.03×/1.82×/1.77×, respectively, compared to Conv6T/feed-cut 8T/ low-power 8T/ low-leakage 7T. The leakage power of the proposed design is reduced by 1.08×/1.84×/0.46×/0.72× compared to Conv6T/feed-cut 8T/ low-power 8T/ low-leakage 7T. The noise margin of the proposed cell for hold/write/read operation is improved by 1.02×/1.05×/0.99×compared to the Conv6T design. The simulation was performed using Stanford University’s 32 nm CNTFET model on the cadence virtuoso platform.

Transfer Fuzzy Learning enabled Streebog Cryptographic Substitution Permutation based zero trust security in IIOT

The advent of the fourth industrial revolution and connection with devices and sensors produced extensive arbitrary, discordant data in IIoT platforms. The IIoT platforms have experienced a sea change and their progressively difficult and acquiring intricate. As a result, devices within the network manifest part of the trusted network, therefore compromising other devices in the network. In order to, circumvent is a requirement for a simple safety mechanism between devices to derived by applying a Zerotrust principle. In this work a novel method called, Streebog Cryptographic Substitution Permutation Network-based Transfer Fuzzy Learning (SCSPN-TFL) to improve the network access time. First, device security is designed via the policy engine and policy administrator module using the SCSPN model. SCSPN is performed into IIoT to improve the secure data communication between devices. Next, the device block is sent to receiver for performing decryption and obtaining original device information by such policy and studying communication patterns between devices. Next, data security is presented via a policy enforcement module using Transfer Fuzzy Learning. The results show that the proposed method achieves better data confidentially rate as 8 %, minimal network access time as 28 %, a better data integrity rate as 9 % and a reduced false positive rate as 25 %, as compared to existing techniques.

Transport network downsizing based on optimal sub-network

Transportation networks are sized to efficiently achieve some set of service objectives. Under particular circumstances, such as the COVID-19 pandemic, the demand for transportation can significantly change, both qualitatively and quantitatively, resulting in an over-capacitated and less efficient network. In this paper, we address this issue by proposing a framework for resizing the network to efficiently cope with the new demand. The framework includes a model to determine an optimal transportation sub-network that guarantees the following: (i) the minimal access time from any node of the urban network to the new sub-network has not excessively increased compared to that of the original transportation network; (ii) the delay induced on any itinerary by the removal of nodes from the original transportation network has not excessively increased; and (iii) the number of removed nodes from the transportation network is within a preset known factor. A solution is optimal if it induces a minimal global delay. We modelled this problem as a Mixed Integer Linear Program and applied it to the public bus transportation network of Lyon, France, in a case study. In order to respond to operational issues, the framework also includes a decision tool that helps the network planners to decide which bus lines to close and which ones to leave open according to specific trade-off preferences. The results on real data in Lyon show that the optimal sub-network from the MILP model can be used to feed the decision tool, leading to operational scenarios for network planners.

Laparoscopy and litigation: small access, small injuries, big trouble

The refinement of optic technology and the commercial availability of laparoscopic hardware in the later part of the 20th century were warmly welcomed by innovative specialists who operated on the abdomen or pelvic cavity. The advantages of minimal access, negligible scarring and shorter recovery time promised higher patient satisfaction and lower hospital costs as well as a tangible sign of surgery taking yet another exciting step into the age of ‘hi-tech’. Many surgeons may also have anticipated shorter operating time, particularly when confronted with obese patients, and some of them would have been right – assuming all went well.

Substitution Box Optimization

The basic principle of encryption is to transform plain data into unintelligible data via a series of steps referred to as an encryption algorithm. The input to this algorithm is called plaintext, and its output encoded version is called as cipher text. Even though there are various algorithms, Advanced Encryption Standard (AES) is adopted due to the availability of optimized hardware components for efficient implementation. The S-Box is one of the critical operations in AES algorithm and it consists of two sub-modules, namely the multiplicative inversion sub-module in GF(2^8) and the Affine transformation sub-module Each input to the S-Box is a 1-byte of intermediate data, x, and the S-Box will generate 1-byte of output S(x). There are variety of methods can used to implement AES S box. Through this project our aim is to optimize the S box for minimal access time. We are planning to implement an optimized implementation of the S-box in the Verilog HDL. By developing the Verilog code for substitution box by using different methods, compare them and implement the same in hardware using FPGA.

Tuning Heterogeneous Computing Platforms for Large-Scale Hydrology Data Management

HydroTerre is a research prototype platform developed at Penn State for the hydrology community. It provides access to aggregated scientific data sets that are useful for hydrological modeling and research. HydroTerre’s frontend is a web service, and a user query can request creation of a data bundle whose size can vary from a few megabytes to 100’s of gigabytes. In this article, we present software tuning and optimization strategies for various hardware configurations of the HydroTerre platform. Our goal is to minimize access time to a wide range of data bundle creation queries from users. We use automated schemes to estimate the computational work required for various queries, and identify the best-performing hardware/software configuration. We hope this study is instructive for researchers developing similar data management cyberinfrastructure in other science and engineering fields.

New heuristics for planning operating rooms

We tackle the operating room planning problem of the Plastic Surgery and Major Burns Specialty of the University Hospital “Virgen del Rocio” in Seville (Spain). The decision problem is to assign an intervention date and an operating room to a set of surgeries on the waiting list, minimizing access time for patients with diverse clinical priority values. This problem has been previously addressed in the literature considering different objective functions. The clinical priority depends on the surgery priority and the number of days spent on the waiting list. We propose a set of 83 heuristics (81 constructive heuristics, a composite heuristic, and a meta-heuristic) based on a new solution encoding, and we compare these methods against existing heuristics from the literature for solving operating room planning problems. The heuristics are adapted to the problem under consideration (i.e. considering all constraints and the new objective function), being re-implemented using the information provided by the authors. In total, after a calibration procedure, we compare 17 heuristics. The computational experiments show that our proposed meta-heuristic is the best for the problem under consideration. Finally, the proposed heuristics are tested using data from the Plastic Surgery and Major Burns Specialty. The results show significant improvements on several key performance indicators (number of scheduled surgeries, quality of surgical plan, resources utilization, etc.) when comparing with the actual results obtained by the specialty in the current practice. The aforementioned hospital is currently implementing the heuristic methods.

Enhancing Quality of Service in Unified Communications using Dynamic CODECs

Unified Communication refers to all forms of communications that are exchanged via the medium of the TCP/IP network to include other forms of communications such as Internet Protocol Television IPTV and Digital Communications. The major objective of unified communication is providing flawless communication. The telephone provides the feasibility of cutting short the distance and minimizing access time so that people can communicate in real time or near real time when they are not together. Also UC provides us the use variety of devices to communicate such as wireless phones, personal digital assistants, personal computers etc. The objective of this paper would be creating higher-quality digital media voice and video content by using dynamic Codecs at the router so that people using different modes of communication, different media, and different devices can still communicate to anyone, anywhere, at any time with enhanced quality of data.

An Integrated Signature Indexing Technique for Information Broadcasting over the Multi-level Wireless Channels

Mobile device has limited battery power, the minimization of the access time and tuning time for the broadcast data is an important problem. There have been many research efforts that focus on minimizing access time and tuning time by providing indexes on the broadcast data. This paper proposes two level energy efficient signatures indexing techniques over the multichannel to reduce power consumption for wireless broadcast. The two-level signature scheme is used for indexing the information frames. At the first level, the integrated signature is used to index the indexes about the information. At the second level a simple signature is used to index the indexes about the information. KeywordsWireless Environment, Multiple Broadcast Channels, Data Allocation, Broadcast Program, Index Information, integrated signature, simple signature.

Cell approximation method in quorum systems for minimizing access time

As part of a service oriented e-Science and Grid infrastructure, a quorum-consensus method is a valuable tool for managing replicated data and finding meaningful patterns of immense data sets. In general, a workflow is defined as set of atomic tasks that may have dependencies between each other. Tasks also may define a so-called "quorum" which denotes a number of precedence constraints to be fulfilled before execution may proceed. To solve the problem of designing a quorum that fits a scalable and dynamic environment where data are distributed sparsely or too far apart, we propose a cell approximation method to fit into some form (e.g., voting, grid) of logical structure in quorum-based protocols. In our method, adjacent nodes are configured by an Intra cell which can improve their data locality. Furthermore, Intra-cell relationships can be represented by an Inter cell for minimizing access time.

A Novel Data Replication and Management Protocol for Mobile Computing Systems

Mobile computing has enabled users to seamlessly access databases even when they are on the move. Mobile computing environments require data management approaches that are able to provide complete and highly available access to shared data at any time from any where. In this paper, we propose a novel replicated data protocol for achieving such goal. The proposed scheme replicates data synchronously over stationary sites based on three dimensional grid structure while objects in mobile sites are asynchronously replicated based on commonly visited sites for each user. This combination allows the proposed protocol to operate with less than full connectivity, to easily adapt to changes in group membership and not require all sites to agree to update data objects at any given time, thus giving the technique flexibility in mobile environments. The proposed replication technique is compared with a baseline replication technique and shown to exhibit high availability, fault tolerance and minimal access times of the data and services, which are very important in an environment with low‐quality communication links.

File-based replica management

Data replication is one of the best known strategies to achieve high levels of availability and fault tolerance, as well as minimal access times for large, distributed user communities using a world-wide Data Grid. In certain scientific application domains, the data volume can reach the order of several petabytes; in these domains, data replication and access optimization play an important role in the manageability and usability of the Grid. In this paper, we present the design and implementation of a replica management Grid middleware that was developed within the EDG project [European DataGrid Project (EDG), http://www.eu-egee.org] and is designed to be extensible so that user communities can adjust its detailed behavior according to their QoS requirements.

Prospective multicentre randomised trial of tension-free vaginal tape and colposuspension as primary treatment for stress incontinence

Objective: To compare tension-free vaginal tape with colposuspension as primary treatment for stress incontinence.Design: Multicentred randomised comparative trial.Setting: Gynaecology or urology departments in 14 centres in the United Kingdom and...

A heuristic storage for minimizing access time of arbitrary data patterns

The serialization of memory accesses is a major limiting factor in high performance SIMD computers. The data patterns or templates that are accessed by a program can be perceived by the compiler, and, therefore, the design of dynamic storage schemes that minimize conflicts may dramatically improve performance. The problem of finding storage schemes that minimize the access time of arbitrary sets of power-of-two data patterns is proved to be NP-complete. We propose linear address transformations that can be dynamically applied by each processing element for mapping array references onto memories. An efficient approach for combining the constraints of different access patterns into one single linear address transformation is presented. We prove that finding the transformation that minimizes the access time is reducible to N-coloring, where N is the number of parallel memories. Using coloring heuristics, storage schemes are investigated with respect to minimizing the implementation cost (perfect storage) and overall access conflicts (semiperfect storage). Results show that the perfect-storage may deviate on the average by 20% from the optimum access time in the case of 10 arbitrary data patterns and 16 memories. However, semiperfect schemes lead to dramatic reduction of the degree of conflict compared to perfect-schemes. The proposed heuristic storage largely outperforms interleaving and row-column-diagonals storages. The method can be implemented as compiler procedure for synthesizing storage schemes that promote parallel access to arbitrary sets of data patterns.

Optimal hot spot allocation on meshes for large-scale data-parallel algorithms

Hot spots are notorious for degrading the performance of a parallel algorithm. We attempt to minimize the hot-spot access time for a class of problems, namely, Large-Scale Data-Parallel (LSDP) algorithms, on a 2D mesh. An LSDP algorithm has rich data parallelism but without exclusive task and data partitioning. Our approach is to allocate the hot spots at the optimal locations such that the hot-spot access time is minimized. Also, we have designed scheduling algorithms which control hot spot access sequences to achieve the minimal access time. Both uniform and nonuniform hot spots have been considered in this study. We have analytically derived the optimal allocations for wrapped-around and non-wrapped-around square meshes. The theoretical results have been verified by parallelizing the EM algorithm for 3D PET image reconstruction on the Intel iPSC/860.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

An integrated pre-access architecture for CMOS SRAM

A proposed architecture for CMOS SRAM, random pre-access memory (RPM), allows any single word address to provide simultaneous access to multiple consecutive words starting at the given address. RPM has this pre-access feature integrated into its circuit design in order to minimize access time and increase organizational flexibility. A technique for implementing RPMs of practical size is described, and the characteristics of the memory are examined. Integrating its pre-access function in a CMOS SRAM results in no significant access time penalty, and an area cost of 2% to 8%, depending on the memory organization and size. This architecture is well suited to integrated memory whose requirements necessitate unaligned, multiword access with minimal delay penalty and no power-of-two access restrictions. In particular, such memory finds application in the instruction caches of high-performance superscalar processors, since these require multiple instruction prefetches in a single cycle. >

Simbad: a process simulator linked to a DBMS—II. the structure of memory

A network type Data Base Management System is used to support the data structure of a modular-sequential, steady state process simulator. The DBMS of a standard CODASYL type is based on the definition of records and the set relationships between an owner and a member record. The structure defined, or SCHEMA, responds to the way data is stored and used during the simultations in order to minimize access time, while maintaining flexibility. An example is developed to illustrate the way data is linked for a particular process application.

Implementing a bubble memory hierarchy system

This paper reports on implementation of a magnetic bubble memory in a two-level hierarchial system. The hierarchy used a major-minor loop device and RAM under microprocessor control. Dynamic memory addressing, dual bus primary memory, and hardware data modification detection are incorporated in the system to minimize access time. It is the objective of the system to incorporate the advantages of bipolar memory with that of bubble domain memory to provide a smart, optimal memory system which is easy to interface and independent of user's system.

A nonvolatile charge-addressed memory (NOVCAM) cell

A nonvolatile charge-addressed memory (NOVCAM) cell is described in a 64-bit shift register configuration. The charge address is performed by a charge-coupled device (CCD) shift register and the information is stored in metal-nitride-oxide-silicon (MNOS) nonvolatile sites located in parallel with the CCD shift register. The tunneling electric field strength across the thin-oxide MNOS structure is controlled by the magnitude of the charge transferred from the CCD register. The write, erase, and read modes of operation are discussed with typical /spl plusmn/20 V 10 /spl mu/s write/erase, and 2 V 2 /spl mu/s read conditions. Readout is accomplished by parallel stabilized charge injection from a diffused p/n junction to minimize access time to the first bit.

Placement of Records on a Secondary Storage Device to Minimize Access Time

The problem considered is how to place records on a secondary storage device to minimize average retrieval time, based on a knowledge of the probability for accessing the records. Theorems are presented for two limiting cases. A numerical example for an intermediate case is also given.