Spelling suggestions: "subject:"erogramming languages"" "subject:"grogramming languages""
1 |
Enhancing network communication in NPSNET-V virtual Environments using XML : Described dynamic Behavior (DBP) ProtocolsFischer, William D. 09 1900 (has links)
The existing component protocols, as well as new protocols introduced at runtime into NPSNET-V are written in their native programming language. As a result, they require authoring and compiling by a trained programmer. The long time frame required to change or introduce new protocols into NPSNET-V, a dynamically extensible virtual environment, detracts from the dynamicism of the virtual environment. Networking optimization thresholds to support NPSNET-V needed to be determined to ensure that the networking is performed efficiently, and system resources to other systems, such as graphics rendering, are maximized. This thesis implements component protocols described using Extensible Markup Language (XML) into NPSNET-V. These protocols are created with different fidelity resolutions for each protocol, which can be swapped at runtime based on the network state. Network testing was performed to find the ideal maximum packet rates based on the impact on CPU utilization and packet loss. By using XML, non-programmers can edit protocols for inclusion in a simulation at runtime. Important contributions include adding protocols to NPSNET-V with high-resolution and low-resolution versions, described by XML documents. Basic network optimization is added to NPSNET-V to take advantage of the protocolsα resolution switching ability. The network testing revealed a linear correlation between the packet sending rate and CPU utilization, and a polynomial correlation between the packet sending rate and percentage packet loss. / US Army (USA) author
|
2 |
Enhancing network communication in NPSNET-V virtual Environments using XML: Described dynamic Behavior (DBP) Protocols/Fischer, William D. January 2001 (has links) (PDF)
Thesis (M.S. in Computer Science)-- Naval Postgraduate School, Sept. 2001. / "September 2001." Thesis advisor(s)McGregor, Don ; Brutzman, Don. Includes bibliographical references (p. 127-128). Also Available online.
|
3 |
An integration of reduction and logic for programming languagesWright, David A January 1988 (has links)
A new declarative language is presented which captures the expressibility of both logic programming languages and functional languages. This is achieved by conditional graph rewriting, with full unification as the parameter passing mechanism. The syntax and semantics are described both formally and informally, and examples are offered to support the expressibility claim made above. The language design is of further interest due to its uniformity and the inclusion of a novel mechanism for type inference in the presence of derived type hierarchies
|
4 |
Higher-level algorithmic structures in the refinement calculusKing, Stephen January 1998 (has links)
No description available.
|
5 |
Logics of domainsZhang, Guo Qiang January 1989 (has links)
No description available.
|
6 |
The design and implementation of Troy, a distributed object-based languageHailes, Stephen Mark Vernon January 1991 (has links)
No description available.
|
7 |
Modular compilation in high level languagesAnderson, Melvin John January 1988 (has links)
No description available.
|
8 |
A formal semantics of parallel features of Fortran 95Reid, N. K. January 2003 (has links)
No description available.
|
9 |
High level language constructs for relational database designConnolly, Michelle M. January 1986 (has links)
No description available.
|
10 |
ParForPy: Loop Parallelism in PythonGaska, Benjamin James, Gaska, Benjamin James January 2017 (has links)
Scientists are trending towards usage of
high-level programming languages such as Python.
The convenience of these languages often have a performance cost.
As the amount of data being processed increases this can make using
these languages unfeasible.
Parallelism is a means to achieve better performance, but many
users are unaware of it, or find it difficult to work with.
This thesis presents ParForPy, a means for loop-parallelization to to simplify usage of parallelism in Python for users.
Discussion is included for determining when parallelism
matches well with the problem.
Results are given that indicate that ParForPy is both capable
of improving program execution time and perceived to be a simpler
construct to understand than other techniques for parallelism in Python.
|
Page generated in 0.1069 seconds