11 |
Petronius and the Greek parodic tradition /Napiorski, Nancy Lynn. January 1996 (has links)
Thesis (Ph. D.)--University of Washington, 1996. / Vita. Includes bibliographical references (leaves [271]-280).
|
12 |
The rhetoric of picaresque irony : a study of the Satyricon and Lazarillo de Tormes /Halvonik, Brent N. January 2000 (has links)
Thesis (Ph. D.)--University of Missouri-Columbia, 2000. / Typescript. Vita. Includes bibliographical references (leaves 251-262). Also available on the Internet.
|
13 |
Petrons urbane Prosa Untersuchungen zu Sprache u. Text : (Syntax) /Petersmann, Hubert. January 1977 (has links)
Habilitationsschrift--Vienna, 1976. / Includes indexes. Includes bibliographical references (p. 13-21).
|
14 |
The rhetoric of picaresque irony a study of the Satyricon and Lazarillo de Tormes /Halvonik, Brent N. January 2000 (has links)
Thesis (Ph. D.)--University of Missouri-Columbia, 2000. / Typescript. Vita. Includes bibliographical references (leaves 251-262). Also available on the Internet.
|
15 |
Problem words in Petronius : a morphological approachDoole, Lyn. January 1983 (has links)
No description available.
|
16 |
Architectures and Theoretical Models for Shared Scratchpad Memory SystemsWittig, Robert Klaus 10 November 2021 (has links)
Computer engineering is advancing rapidly. For 55 years, the performance of integrated circuits has almost doubled every 18 months. Mostly, these advancements were enabled by technological progress. Even the end of frequency scaling could not bring the ever-increasing performance growth to a halt. However, technology burdens, like noticeable leakage currents, have piled up, which shifts the focus towards architectural improvements. Especially the multi-core paradigm has proven its virtue for chip designs over the last decade. While having been introduced in high-performance computing areas, modern technology nodes also enable low-cost, low-power embedded designs to benefi t from multiple cores and accelerators. Since the majority of cores depend on memory, which requires a considerable amount of chip area, this common resource needs to be shared effi ciently. High-performance cores use shared caches to increase memory utilization. However, many accelerators do not use caches as they need predictable and fast scratchpad memory (SM). But sharing SM entails confl icts, questioning its fast and predictable nature. Hence, the question arises on how to adapt architectures for sharing while retaining SM’s advantages.
This thesis presents a novel, shared SM architecture that embraces the idea of a minimal logic path between core and memory, thereby increasing the maximum operating frequency. Because of its additional capabilities, like dynamic address translation and programmable priorities, it is also well suited for heterogeneous platforms that use dynamic scheduling and require predictable behavior. Demonstrating its advantages, we analyze the characteristics of the new architecture and compare it to state-of-the-art approaches. To further mitigate confl icts, we present the conception of access interval prediction (AIP). By predicting memory accesses with a granularity of a single clock cycle, AIP guides the allocation of resources. This method maximizes memory utilization while reducing confl ict delays. With the help of various methods inspired by branch prediction, we achieve over 90 % of accurate predictions and reduce stall cycles signifi cantly. Another key contribution of this thesis is the extension of analytic models to estimate the throughput of shared SM systems. Again, the focus lies on heterogeneous systems with different priorities and access patterns. The results show a promising error reduction, boosting the used
models applicability for real design use cases.
|
17 |
Problem words in Petronius : a morphological approachDoole, Lyn. January 1983 (has links)
No description available.
|
18 |
Asynchronous Ring Network Mechanism with A Fair Arbitration Strategy for Network on ChipWong, Chen-Ang 14 August 2012 (has links)
The multi-core systems are usually implemented on homogeneous or heterogeneous cores, in order to design the better NOC (network on chip), it must consider the performance, scalability, simplifies hardware design and arbitration strategy at the on chip network. The routers are designed with circuit-switched network, circuit switching is asynchronous circuits and routers have no queuing (buffering), therefore, it is simple and efficient in implementation. Synchronous circuit is network with a clock source, but the distributing global clock has many problems such as power consumption, increasing the area and Clock skew. Ring topology with multi-transaction bus architecture. It could make multiple packets to access the bus at the same time, so that the multi-transaction bus architecture is better to get more throughputs. When the number of cores increase, the central arbiter circuit is more complexity, this thesis presents an SAP (self-adjusting priority) schedule that can fairly adjust priorities of each component by appropriately exchanging weighting at distributed arbiter. When numerous requests encounter contention on a network, a winner owning the highest priority will exchange its priority with the lowest priority of these requests. This principle guarantees that winners will decreased the opportunity of incurring network at the next time. In opposition, these losers can obtain the higher priority than that of the original. Therefore, the proposed scheme not only offers fair strategy, but also simplifies hardware design.
|
19 |
Petron 39 und die AstrologieVreese, Jacques de. January 1927 (has links)
Thesis (doctoral)--Universteit van Amsterdam, 1927. / Includes bibliographical references (p. [248]-255) and index.
|
20 |
The participle in Plautus, Petronius, and ApuleiusSidey, Thomas Kay. January 1909 (has links)
Thesis (Ph. D.)--University of Chicago, 1900.
|
Page generated in 0.0462 seconds