548 resultados para asynchronous
Resumo:
"Presented at the AIEE fall general meeting, Chicago, Illinois, October l1, 1960. This work was supported in part by the Office of Naval Research under contract Nonr-1834 (27)."
Resumo:
Thesis (M.Sc.)--University of Illinois at Urbana-Champaign.
Resumo:
"This work has been supported in part by the Office of Naval Research under Contract NR 044 001"
Resumo:
"December 6, 1955"
Resumo:
We describe an extension of the theory of Owicki and Gries (1976) to a programming language that supports asynchronous message passing based on unconditional send actions and conditional receive actions. The focus is on exploring the fitness of the extension for distributed program derivation. A number of experiments are reported, based on a running example problem, and with the aim of exploring design heuristics and of streamlining derivations and progress arguments.
Resumo:
We present the first experimental demonstration of an asynchronous digital optical regenerator at 42.67 Gbit/s. The system effectively retimes incoming asynchronous data bursts to a local clock without burst mode clock recovery and converts the signal to a desired wavelength and duty cycle.
Resumo:
The tolerance of a 42.65 Gbit/s dual-gate asynchronous digital optical regenerator using a single Mach-Zehnder modulator to optical signal-to-noise-ratio degradation and chromatic dispersion is experimentally demonstrated.
Resumo:
This research explored how a more student-directed learning design can support the creation of togetherness and belonging in a community of distance learners in formal higher education. Postgraduate students in a New Zealand School of Education experienced two different learning tasks as part of their online distance learning studies. The tasks centered around two online asynchronous discussions each for the same period of time and with the same group of students, but following two different learning design principles. All messages were analyzed using a twostep analysis process, content analysis and social network analysis. Although the findings showed a balance of power between the tutor and the students in the first high e-moderated activity, a better pattern of group interaction and community feeling was found in the low e-moderated activity. The paper will discuss the findings in terms of the implications for learning design and the role of the tutor.
Resumo:
We propose and numerically analyse an asynchronous digital optical regenerator using a single-EAM loop and a novel neighbor-combine approach. It effectively re-synchronizes input signals with arbitrary phases to the local clock, and regenerates signals with high amplitude fluctuation and polarization mode dispersion. We demonstrate the application of this regenerator for 4 x 40 Gbit/s WDM to 160 Gbit/s OTDM conversion.
Resumo:
We propose and numerically analyse an asynchronous digital optical regenerator using a single-EAM loop and a novel neighbor-combine approach. It effectively re-synchronizes input signals with arbitrary phases to the local clock, and regenerates signals with high amplitude fluctuation and polarization mode dispersion. We demonstrate the application of this regenerator for 4 x 40 Gbit/s WDM to 160 Gbit/s OTDM conversion.
Resumo:
Buffered crossbar switches have recently attracted considerable attention as the next generation of high speed interconnects. They are a special type of crossbar switches with an exclusive buffer at each crosspoint of the crossbar. They demonstrate unique advantages over traditional unbuffered crossbar switches, such as high throughput, low latency, and asynchronous packet scheduling. However, since crosspoint buffers are expensive on-chip memories, it is desired that each crosspoint has only a small buffer. This dissertation proposes a series of practical algorithms and techniques for efficient packet scheduling for buffered crossbar switches. To reduce the hardware cost of such switches and make them scalable, we considered partially buffered crossbars, whose crosspoint buffers can be of an arbitrarily small size. Firstly, we introduced a hybrid scheme called Packet-mode Asynchronous Scheduling Algorithm (PASA) to schedule best effort traffic. PASA combines the features of both distributed and centralized scheduling algorithms and can directly handle variable length packets without Segmentation And Reassembly (SAR). We showed by theoretical analysis that it achieves 100% throughput for any admissible traffic in a crossbar with a speedup of two. Moreover, outputs in PASA have a large probability to avoid the more time-consuming centralized scheduling process, and thus make fast scheduling decisions. Secondly, we proposed the Fair Asynchronous Segment Scheduling (FASS) algorithm to handle guaranteed performance traffic with explicit flow rates. FASS reduces the crosspoint buffer size by dividing packets into shorter segments before transmission. It also provides tight constant performance guarantees by emulating the ideal Generalized Processor Sharing (GPS) model. Furthermore, FASS requires no speedup for the crossbar, lowering the hardware cost and improving the switch capacity. Thirdly, we presented a bandwidth allocation scheme called Queue Length Proportional (QLP) to apply FASS to best effort traffic. QLP dynamically obtains a feasible bandwidth allocation matrix based on the queue length information, and thus assists the crossbar switch to be more work-conserving. The feasibility and stability of QLP were proved, no matter whether the traffic distribution is uniform or non-uniform. Hence, based on bandwidth allocation of QLP, FASS can also achieve 100% throughput for best effort traffic in a crossbar without speedup.
Resumo:
The effectiveness of an optimization algorithm can be reduced to its ability to navigate an objective function’s topology. Hybrid optimization algorithms combine various optimization algorithms using a single meta-heuristic so that the hybrid algorithm is more robust, computationally efficient, and/or accurate than the individual algorithms it is made of. This thesis proposes a novel meta-heuristic that uses search vectors to select the constituent algorithm that is appropriate for a given objective function. The hybrid is shown to perform competitively against several existing hybrid and non-hybrid optimization algorithms over a set of three hundred test cases. This thesis also proposes a general framework for evaluating the effectiveness of hybrid optimization algorithms. Finally, this thesis presents an improved Method of Characteristics Code with novel boundary conditions, which better characterizes pipelines than previous codes. This code is coupled with the hybrid optimization algorithm in order to optimize the operation of real-world piston pumps.
Resumo:
It has been years since the introduction of the Dynamic Network Optimization (DNO) concept, yet the DNO development is still at its infant stage, largely due to a lack of breakthrough in minimizing the lengthy optimization runtime. Our previous work, a distributed parallel solution, has achieved a significant speed gain. To cater for the increased optimization complexity pressed by the uptake of smartphones and tablets, however, this paper examines the potential areas for further improvement and presents a novel asynchronous distributed parallel design that minimizes the inter-process communications. The new approach is implemented and applied to real-life projects whose results demonstrate an augmented acceleration of 7.5 times on a 16-core distributed system compared to 6.1 of our previous solution. Moreover, there is no degradation in the optimization outcome. This is a solid sprint towards the realization of DNO.
Resumo:
This PhD by publication examines selected practice-based audio-visual works made by the author over a ten-year period, placing them in a critical context. Central to the publications, and the focus of the thesis, is an exploration of the role of sound in the creation of dialectic tension between the audio, the visual and the audience. By first analysing a number of texts (films/videos and key writings) the thesis locates the principal issues and debates around the use of audio in artists’ moving image practice. From this it is argued that asynchronism, first advocated in 1929 by Pudovkin as a response to the advent of synchronised sound, can be used to articulate audio-visual relationships. Central to asynchronism’s application in this paper is a recognition of the propensity for sound and image to adhere, and in visual music for there to be a literal equation of audio with the visual, often married with a quest for the synaesthetic. These elements can either be used in an illusionist fashion, or employed as part of an anti-illusionist strategy for realising dialectic. Using this as a theoretical basis, the paper examines how the publications implement asynchronism, including digital mapping to facilitate innovative reciprocal sound and image combinations, and the asynchronous use of ‘found sound’ from a range of online sources to reframe the moving image. The synthesis of publications and practice demonstrates that asynchronism can both underpin the creation of dialectic, and be an integral component in an audio-visual anti-illusionist methodology.