Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 12 of 12 for “"Access graph"”.

  1. Address optimizations for embedded processors

    … with one address register; start with the access sequence of variables to determine the optimal assignment. This research uses the basic block to commutatively transform statements to alter the access sequence. Edges in the access graphs are classified into breakable and unbreakable edges. …

    lsu-thes Repository record for Address optimizations for embedded processors (opens in a new tab)

  2. An Optimization Framework for Embedded Processors with Auto-Modify Addressing Modes

    … dedicated address generation unit support memory accesses using indirect addressing mode with auto-increment and auto-decrement. The auto-increment/decrement mode, if properly utilized, can save address arithmetic instructions, reduce static and dynamic footprint of the program and speed up the …

    gatech Repository record for An Optimization Framework for Embedded Processors with Auto-Modify Addressing Modes (opens in a new tab)

  3. Variations on the Theme of Caching

    … using the relative competitiveness ratio on an access graph as a complexity measure. We use the concept of access graphs introduced by Borodin [11] to define our own concept of relative competitive ratio. We demonstrate results regarding the relative competitiveness of two cache eviction …

    waterloo Repository record for Variations on the Theme of Caching (opens in a new tab)

  4. Modeling Dust Movement in a Hospital by Using Space Syntax Access Diagramming

    … a method of architectural diagramming called access analysis to provide insights on how dust may be transmitted throughout buildings, in particular via doorways and through the HVAC system. Access analysis is derived from Space Syntax methods of understanding the spatial configuration of a …

    tamu Repository record for Modeling Dust Movement in a Hospital by Using Space Syntax Access Diagramming (opens in a new tab)

  5. Data structure splicing

    … spatial locality. When data fields that are accessed together are also collocated in the address space, the utilization of hardware caches improves and cache misses decline. A number of approaches to DSS have been proposed, but each addressed only one or two splicing optimizations (e.g., only …

    ubc Repository record for Data structure splicing (opens in a new tab) Download PDF for Data structure splicing (opens in a new tab)

  6. Views and consistencies in distributed shared memory

    … as consistency requirements often incur long access latencies that cannot be overlapped with other operations in a process. Sequential consistency is the most general consistency requirement for DSM systems. This thesis explores two different avenues to solve the performance problem for DSM …

    concordia Download PDF for Views and consistencies in distributed shared memory (opens in a new tab)

  7. Statistical Analysis and Modeling of Cyber Security and Health Sciences

    … be used to identify critical nodes in the host access graph where attackers may be most likely to focus. Based on that information, a network administrator can make appropriate, prioritized decisions for system patching. Further, a flexible risk ranking technique is described, where the …

    usf Repository record for Statistical Analysis and Modeling of Cyber Security and Health Sciences (opens in a new tab)

  8. Aggregation, dissemination and filtering : controlling complex information flows in networks

    … refresh-rate in terms of the underlying graph structure; furthermore we develop optimal algorithms for general networks, and also a simple distributed algorithm for acyclic wired networks. Dissemination: We consider dissemination processes on networks via intrinsic peer-to-peer …

    texas Repository record for Aggregation, dissemination and filtering : controlling complex information flows in networks (opens in a new tab)

  9. Alternative Approaches for Analysis of Bin Packing and List Update Problems

    … knowledge about the input sequence, e.g., the access graph model for the paging problem. We study list update and bin packing problems under the advice model and answer several relevant questions about the advice complexity of these problems. Online problems are usually studied under specific …

    waterloo Repository record for Alternative Approaches for Analysis of Bin Packing and List Update Problems (opens in a new tab)

  10. Research In High Performance And Low Power Computer Systems For Data-intensive Environment

    … is especially true for those with sophisticated access patterns. For example, Yahoo's Hadoop {refg} clusters employs a random data placement strategy for load balance and simplicity {reff}. This allows the MapReduce {DG08} programs to access all the data (without or not distinguishing interest …

    ucf Repository record for Research In High Performance And Low Power Computer Systems For Data-intensive Environment (opens in a new tab)

  11. A DIVERSE BAND-AWARE DYNAMIC SPECTRUM ACCESS ARCHITECTURE FOR CONNECTIVITY IN RURAL COMMUNITIES

    … account for 46% of the world's population lacks access to proper connectivity to avail such societal benefits, creating a huge "digital divide" between the urban and rural areas. A primary reason is that the Information and Communication Technologies (ICT) providers have less incentives to invest …

    uky-thes Repository record for A DIVERSE BAND-AWARE DYNAMIC SPECTRUM ACCESS ARCHITECTURE FOR CONNECTIVITY IN RURAL COMMUNITIES (opens in a new tab)

  12. ENABLING MULTI-PARTY COLLABORATIVE DATA ACCESS

    … of services at unprecedented scales but data accessibility considerations become more complex due to involvement of multiple parties in providing the infrastructure. In this thesis, we discuss the problem of enabling cooperative data access in a multi-cloud environment where the data is owned …

    temple Repository record for ENABLING MULTI-PARTY COLLABORATIVE DATA ACCESS (opens in a new tab)