Browsing by Subject "Programming languages (Electronic computers)"
Now showing 1 - 13 of 13
Results Per Page
Sort Options
Item A parallel communication architecture for the language SequenceL / by Julian B. Russbach.(Texas Tech University, 2004-12) Russbach, Julian BSequenceL is a language that discovers all parallelisms in a program from the nature of its execution cycle. This suggests the language is a good candidate for execution in a distributed memory, high performance computing environment. However, unrestricted execution of SequenceL parallelisms in distributed memory can lead to problems of granularity and load imbalance associated with the distribution of fully parallelized program and data. This thesis is a proof of concept investigation into a token ring communication architecture to load balance SequenceL execution in a distributed memory environment. The thesis provides a background over previous work on SequenceL in distributed memory, research into dynamic load balancing and token rings, and a methodology for construction of the communication architecture. This thesis has achieved the following results: • A non-recursive C SequenceL interpreter written and tested on a set of SequenceL programs. • A working distributed memory communication architecture and parallelized SequenceL execution • A distributed memory representation of SequenceL • A method of enforcing persistent SequenceL data and programs • Performance measurements of SequenceL programs executed on the communication architectureItem A reference architecture for distributed intelligent systems and a preliminary description language for their integration(Texas Tech University, 1993-05) Bird, Shawn DanielArtificial Intelligence and information systems research is just beginning to grapple with the problems of integrating autonomous, intelligent machine and human agents into complex problem-solving systems. These powerful multi-agent collaborative systems are theoretically possible, but conceptual tools for their development are lacking. This research develops a general model of distributed intelligent systems and a layered language for agent interaction in an attempt to provide a foundation for the realization of such conceptual tools. The model provides a basic definition of distributed, asynchronous, intelligent problem-solving systems. The language, which is constructed from temporal and modal logics, provides an axiomatized logical system in which the knowledge, beliefs, and intentions of multiple agents are exchanged. Combined, the language and model provide a reference architecture for the development of, and future research into distributed intelligent systems.Item A unified approach to development of high-level language programs for microprocessors(Texas Tech University, 1976-08) Chennappan, Kuppusami ChettiarNot availableItem Evaluating the infrastructure of software applications(Texas Tech University, 2002-08) Owen, Cherry KeaheyIn the current environment of heterogeneous distributed computer systems, user applications are more dependent than ever on the infrastructure products. These products include various operating systems, network software, device drivers, and other services needed by the user applications. When user applications request services from the operating system and other system software, it is desirable for the requests to be satisfied in a predictable manner. A user application most frequently interacts with the infrastructure through C and C++ function calls. This research studied the class of functions defined by si X s2 - • si, where si and s2 are null terminated strings, and manipulation is done on the two strings to produce a result that is placed in the original space for si. Through experimentation, it was found that 9 of 25 C and C++ functions tested allowed writing past the allocated space for si. WTiatever variable or data structure happened to be located in the memory following si was overwritten. Since the string arguments were passed by reference, these memory overwrites were undocumented updates to the address space of the calling program. Thus the scope of effect for the fiinction was extended, and the result was unpredictable. A filter has been written to show how memory overwriting can be eliminated for functions in the si X s2 - • si class. The filter truncates the result string before overwriting occurs. A truncated string is still an error, but the error is returned through the defined interface for the function, and is predictable. This type of error does not extend the effect, or scope, of the function. Thus the error can be constrained to a defined subset of the application, and debugging will he much easier. The filter is currently implemented for only two functions. However, in future research, the concept could be used to build a megafilter to handle all functions of the si X s2 -• si class. Eventually other classes of functions could be included, and research could be done toward development of a etafilter to handle more than one class of functions.Item Extensible language implementation(2002) Kolbly, Donovan Michael; Novak, Gordon S.Item Incorporating domain-specific information into the compilation process(2003-05) Guyer, Samuel Zev; Lin, Yun CalvinDespite many advances in compiler research, traditional compilers continue to suffer from one significant limitation: they only recognize the low-level primitive constructs of their languages. In contrast, programmers increasingly benefit from higher level software components, which implement a variety of specialized domains—everything from basic file access to 3D graphics and parallel programming. The result is a marked difference between the level of abstraction in software development and the level of abstraction in compilation. In this thesis we present the Broadway compiler, which closes this gap. Broadway represents a new kind of compiler, called a library-level compiler, that supports domainspecific compilation by extending the benefits of compiler support to software libraries. The key to our approach is a separate annotation language that conveys domain-specific information about libraries to our compiler, allowing it to treat library routines more like built-in language operations. Using this information, the compiler can perform library-level program analysis and apply library-level optimizations. We explore both the opportunities and challenges presented by library-level compilation. We show that library-level optimizations can increase the performance of several parallel programs written using a highly-tuned parallel linear algebra library. These highlevel optimizations are beyond the capabilities of a traditional compiler and even rival the performance of programs hand-coded by an expert. We also show that our compiler is an effective tool for detecting a range of library-level errors, including several significant security vulnerabilities. Finally, we present a new client-driven pointer analysis algorithm, which provides precise and scalable program analysis to meet the demanding requirements of library-level compilation.Item Investigation of a fuzzy grammar for automated visual inspection(Texas Tech University, 1989-08) Hahn, Kwang-sooAutomated visual inspection involves complex image processing and analysis. Representation of images in syntactic form facilitates parsing of images so that defects can be identified as syntactical errors in the same way that programming errors are detected by a language parser. The syntactic approach for image processing uses image grammars to describe images and a parser to recognize images. A problem with the syntactic approach is that the conventional grammars are too formal to handle uncertainty caused by various noise and pattern distortions in images. In this dissertation, a fuzzy grammar based on fuzzy set theory is investigated for automated visual inspection. A fuzzy context-free grammar is defined and applied for inspection of VLSI circuit patterns. This dissertation contributes to syntactic analysis of images by enhancing descriptive power of grammars to handle vague descriptions of images.Item Language and compiler support for mixin programming(2002-05) Cardone, Richard Joseph; Lin, Yun CalvinItem Parallelization of scientific legacy code(Texas Tech University, 2003-12) Hernández, Karem BriceñoPresently, The National Aeronautics and Space Administration (NASA) conducts research through its Earth Observation System (EOS) to answer questions about global dynamics. The most comprehensive EOS instrument is MODIS (The Moderate-resolution Imaging Spectroradiometer) which has several data products. One of these products is MODIS LAI/FPAR (MOD 15). The algorithm for this product consists of two modules: M0DI5A1 which produces series of daily candidates LAI/FPAR data products and MOD15A2 which produces a 8-day composite to be archived. The purpose of the present work is to demonstrate that in spite of the elevated cost implied, parallelization for particular EOS applications might be worthwhile. For this, a previous analysis four years ago of tae serial M0D15A1 code was completed showing that the time may be reduced significantly. For that reason, some changes were made to the code with tae purpose of miming it on parallel. With these changes, an experimental run performed with threads demonstrated that m fact the time reduces to half of the time by using two processors m comparison with the serial version that used only one processor. Given that platforms with more than 2 processors were not readily available at that time, because of price, it is until now that we can easily perform those tests. Therefore, parallelization of this code was motivated to experiment with more processors m order to verify the level of performance that this code could attain, which is the main objective of the present work. With these experiments, it is confirmed that parallelization does improve the execution tune for this particular product but it does not scale up as it is estimated.Item Query languages for a heterogeneous temporal database(Texas Tech University, 1986-08) Yeung, Chung-singTime is an important dimension in databases. In a conventional database, out-of-ate information is usually replaced by current information to keep the database up-to-date. In many applications, discarding old information is inappropriate. A temporal database incorporates the notion of time. Objects in a temporal database are not deleted. On the contrary, they are retained and time-stamped to indicate their periods of existence in the real world. Over the last few years, a number of temporal relational database models have been proposed. This thesis reviews these models and proposes a heterogeneous model. We also develop a relational algebra and a tuple calculus for this model and prove their equivalence. The model and query languages capture the concept of "always" and "sometime" in natural language. In addition, they provide powerful operations with respect to temporal properties of information contained in tuples. When compared to existing approaches, fewer operations are needed to express complex queries. As a result, fewer intermediate scratch pads will be used during query execution. Consequently the space and time complexity introduced by the temporal dimension in temporal databases will be reduced.Item The effects of two approaches to basic programming on the achievement and attitude of field independent and field dependent students(Texas Tech University, 1995-05) Robinson, Jerald D.The major purposes of this study were (a) to determine which of two approaches to BASIC computer progrcunming, standard instruction or graphics instruction, would improve programming skills of middle school students who are at the novice programming level, (b) to determine if there is any interaction between the cognitive styles, field dependent and field independent, and programming instruction on achievement in a BASIC programming class, (c) to determine if there is any interaction between gender and programming instruction in a BASIC programming class, and (d) to determine if attitude toward computer use is affected by either of two methods of progrsmiming instruction.Item Verification of Data Type Consistency(Texas Tech University, 1981-05) Lee, Kuo-Ying Carolyn ChiangNot Available.Item Verification of SequenceL programs using Mizar(2010-08) Ozyavas, Adem; Rusthon, Nelson J.; Cooke, Daniel E.; Byerly, Robert E.Purely functional language programs are claimed to lend themselves more easily to their proof of correctness. SequenceL, exclusively designed at Texas Tech University, is a strict functional language. There are some proof-assistants used in verification of functional language programs. In this research, we used one of the available proof assistants called Mizar to prove correctness of SequenceL programs. Mizar is based on Tarski-Grothendieck set theory formulated in a first-order language. The Mizar language is human readable compared to other formal systems. It also has some other desirable features for our purposes. The result of this research is a Mizar file that describes a semantics of SequenceL and the framework in which properties of SequenceL programs can be proved. Some examples such as factorial and Euclidian greatest common divisor are given in the Mizar file. Also, a reasonably sized library of proven statements is provided intended to shorten the proofs of properties of SequenceL programs.