Geometry.Net - Basic_C: Concurrent Programming


Home - Basic_C - Concurrent Programming

e99.com Bookstore

Images

Newsgroups

121-140 of 140 Back | 1 | 2 | 3 | 4 | 5 | 6 | 7

A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

Concurrent Programming: more books (100)

XCPL: An experimental concurrent programming language (Technical report. California Institute of Technology. Computer Science Dept) by W. C Athas, 1985
Secondary storage in a concurrent logic programming environment (Research report. University of Saskatchewan. Dept. of Computational Science) by Anthony Joseph Kusalik, 1987
Concurrent Programming in Java by Doug Lea , 1999-12-07
Java Threads (Covers J2se 5.0): Understanding and Mastering Concurrent Programming by Scott Oaks Henry Wong, 2007-01-01
Embedding Linda and other joys of concurrent logic programming (Technical report. Weizmann Institute of Science. Dept. of Computer Science) by Ehud Y Shapiro, 1989
Theories of translation correctness for concurrent programming languages (Thesis. University of Edinburgh. Dept. of Computer Science) by Mark Millington, 1987
Preserving abstraction in concurrent programming (TR. University of Cambridge. Computer Laboratory) by R. C. B Cooper, 1985
Enterprise Edition Topics: " Effective Java Programming Language Guide " , " Inside Java 2 Platform Security " , " Concurrent Programming in Java " , " Java Platform Performance " by Inc. Sun Microsystems, 2004-12-17
Concurrent Systems with Concurrent Programming in Java: Design Principles and Pattern by J. Bacon, 2004-09-27
ACT++ 2.0: A class library for concurrent programming in C++ using actors (TR) by Dennis Kafura, 1992
Concurrent Programming in Ada by Alan Burns, 1985
Language support for communication-oriented concurrent programming in unix enviroment [i.e. environment] (Computer science technical report series) by Andrez Hoppe, 1989
Programming and Programming Languages: Concurrent Programming (Course M353)
A white paper on concurrent programming (Technical report. Brown University. Dept. of Computer Science) by Thomas W Doeppner, 1987

lists with details

Zhenyu Qian
Universit¤t Bremen Java security, extensions, and semantics; object-oriented, functional, concurrent, logic programming languages; specification languages; compiler construction; program specification, construction and transformation; object-oriented analyis and design; types; lambda-calculus; unification; algebraic semantics; and theorem proving systems.
http://www.informatik.uni-bremen.de/~qian/qian.html
Napier88
programming system (language and persistent environment) from University of St Andrews. Features orthogonal persistence, type completeness, higherorder procedures, abstract (existential) data types, collections of bindings, strongly typed stable store, graphical data types, concurrent execution and data access, support for reflective programming.
http://www-ppg.dcs.st-and.ac.uk/Languages/Napier88/

Extractions: Napier88 is a programming language named after John Napier . Some on-line documentation is available. The Napier88 persistent programming system provides the following facilities: The Napier88 system consists of the language and its persistent environment. The persistent store is populated and, indeed, the system uses objects within the persistent store to support itself. The implication of orthogonal persistence is that the user need never write code to move or convert data for long or short term storage [ABC+83] . The model of persistence in Napier88 is that of reachability from a root object. The persistent store is also stable, that is, it is transformed from one consistent state to the next. Stabilisation must be performed by the user to preserve data except that programs which terminate normally generate an automatic stabilise operation. Execution against the persistent store is always restarted from the last stabilised state.
GNU Tools For The HP3000
Online documentation for GNU programming tools for the HP 3000 standard with all HP 3000s with the MPE/iX POSIX shell. Tools include Make and CVS. CVS (concurrent Versions System) a version control/software configuration management utility used by a number of HP 3000 programmers.
http://www.dis.com/gnu.html

Extractions: I would like to thank the support and suggestions I've received from Steve Elmer of HP and Jeff Law at the University of Utah while working on this port. There has recently been some significant interest in these activities by a number of companies, including HP. It looks like the only C++ compiler that will be available on the 3000 will be the GNU tools. Please refer to the GNU General Public License for terms under which this will be available. These tools can be found on HP's Jazz server. Detailed instructions can be found in on Jazz through here Online documentation is available for the following: == User Documentation. == Internal Documentation. GCC Documentation GCC C Pre-processor GNU Assembler Pre-processor Documentation GNU Profiler Documentation ... Autoconf Configuration Documentation webmaster@dis.com
Sanjiva Prasad's Home Page
Indian Institute of Technology, Delhi programming Languages, concurrent Systems
http://www.cse.iitd.ernet.in/~sanjiva

Extractions: Hauz Khas, New Delhi 110016 INDIA Office : VI-126 E-mail sanjiva@cse.iitd.ernet.in PHONE : (+91 11) 659 1294 (Office) PHONE : (+91 11) 651 5652 (Res) PHONE : (+91 11) 659 1684 (Res) FAX I am interested in the design and implementation of programming languages for mobile distributed computing. This includes an interest in process calculi for mobility security protocols , type systems and functional programming. I also am interested in verification of programs, protocols and systems. I occasionally dabble in very elementary proof theory. An Introduction to Operational Semantics Sanjiva Prasad and S. Arun-Kumar. In Y. N. Srikant and P. Shankar (eds), Compiler Design Handbook: Optimizations and Machine Code" , CRC Press, Boca Raton, 2002. Reflecting BDDs in Coq Kumar Neeraj Verma, Jean Goubault-Larrecq, Sanjiva Prasad and S. Arun-Kumar. Extended abstract appears in Proceedings of ASIAN'00
CMU CS Venari Project Home Page
The thrust of the Venari project at Carnegie Mellon University is addressing the problem of search, hence the name. We touch upon areas in programming and specification language design, semantics, and implementation; concurrent and distributed systems; databases and persistent objects; and software development libraries and environments.
http://www-2.cs.cmu.edu/afs/cs/project/venari/www/home.html

Extractions: Venari means "to hunt" in Latin. The thrust of the Venari project at Carnegie Mellon University is addressing the problem of search , hence the name. We touch upon areas in programming and specification language design, semantics, and implementation; concurrent and distributed systems; databases and persistent objects; and software development libraries and environments. The primary goal of the Venari Project is to provide software support for storing, accessing, and retrieving objects based on their semantics. To support that goal, we have designed and implemented linguistic extensions to the Standard ML programming language to provide persistent data and transactions. A more complete statement of the project's goals is available here (in PostScript). Follow any of the links below to get the abstract and a pointer to the full text. Venari/ML: design and implementation of concurrent transactions for ML. Nicholas Haines, Darrell Kindred, J. Gregory Morrisett, Scott M. Nettles, and Jeannette M. Wing, Composing First-Class Transactions ACM Transactions on Programming Languages and Systems , Short Communication, November 1994.
Nissim Francez's Home Page
The Technion Formal semantics of natural language, computational linguistics, semantics of programming languages, program verification, concurrent and distributed programming, logic programming.
http://www.cs.technion.ac.il/~francez/

Extractions: CS home page Main: Formal semantics of Natural language, Type-logical grammar, Computational linguistics, unification-based grammar formalisms (LFG, HPSG). Secondary: Semantics of programming languages, program verification. Concurrent and distributed programming. Logic programming. My research activity is within the Computational Linguistics Laboratory (LCL). My CV
Old Home Page Of Maurizio Gabbrielli, Professor Of Computer Science
University of Udine Formal methods for program verification and analysis, theory of concurrent constraint programming, program transformations, languages for real-time applications, logic programming.
http://www.dimi.uniud.it/~gabbri/

Extractions: Professor of Computer Science This page is obsolete since Maurizio Gabbrielli has moved to the University of Bologna Please find here his new page Conferences CL 2000 (PC member, Stream on Theory and Extensions ), July 2000, London. PPDP 2000 The 2nd Int'l Conf. on Principles and Practice of Declarative Programming
Concurrency And Computation Practice And Experience (Journal)
Peerreviewed articles covering concurrent solutions, algorithms, programming environments and applicatons. Published by Wiley InterScience.
http://www.interscience.wiley.com/jpages/1532-0626/
Oz Programming System
concurrent constraint programming language designed for applications needing complex symbolic computations, organization into multiple agents, and soft realtime control. The original Oz DFKI Oz 2.0; features, tools, documents, download. Predecessor of Mozart.
http://www.ps.uni-sb.de/oz2/
Baquero, Carlos
Minho University Distributed systems and mobile computing, concurrent object-oriented programming.
http://gsd.di.uminho.pt/cbm/

Extractions: EMail: cbm (at) di.uminho.pt Working on Panasync: Dependency Tracking among File Copies Co-editor of GilDot , A slashdot like forum to promote Open Software in Portugal. Contributing to the Palm Pilot comunity with some Free Software External collaboration in the IST program of the European Commission.
The Scala Programming Language
A general purpose programming language with a special focus on web services. It combines objectoriented, functional and concurrent elements. It is a successor of Funnel. Java-based implementation.
http://lamp.epfl.ch/scala/

Extractions: S c a l a Home Overview Documentation Downloads Examples Reporting a Bug ... Community The Scala Programming Language Scala is a modern multi-paradigm programming language designed to express common programming patterns in a concise, elegant, and type-safe way. It smoothly integrates features of object-oriented and functional languages. Scala is object-oriented Scala is a pure object-oriented language in the sense that every value is an object . Types and behavior of objects are described by classes and traits . Class abstractions are extended by subclassing and a flexible mixin-based composition mechanism as a clean replacement for multiple inheritance. Scala is functional Scala is also a functional language in the sense that every function is a value . Scala provides a lightweight syntax for defining anonymous functions, it supports higher-order functions , it allows functions to be nested , and supports currying . Scala's case classes and its built-in support for pattern matching model algebraic types used in many functional programming languages. Furthermore, Scala's notion of pattern matching naturally extends to the
Cybele From Intelligent Automation Inc
OpenCybele, the open source agent infrastructure, is a runtime environment built on the top of the Java(TM) 2 platform for control and execution of agents. Features include plugn-play capability of agent services, Activity Centric programming (ACP), multi-thread support for concurrent agent execution, location independent communication, publish-subscribe based messaging, synchronous, asynchronous, broadcast, and point-to-point messaging.
http://www.opencybele.org
A Distributed Implementation Of The C-Linda Programming Language
Language combining C and Linda, gives six functions for concurrent process coordination, can be added to any other sequential language, unlike many other parallel languages, programmers needn't learn a new language. Thesis with essay, bibliography, code samples.
http://www.cs.oberlin.edu/~jbasney/honors/thesis.html

Extractions: May 1995 Professor David Arnow (Brooklyn College, City University of New York) has developed a C library for distributed programming on Unix systems called DP. The DP project has three main goals: power, simplicity, and implementability. The DP functions should be powerful enough to implement most distributed applications. They should be a simplified interface to the facilities already present in Unix for process management and communication. Additionally, they should be implementable on most distributed computing platforms. DP provides the C programmer with reliable message passing between processes and simplified non-local process spawning. The C-Linda language is a natural continuation of the above goals. It provides a metaphor for concurrent programming that can serve as an abstraction of the functionality provided by DP. The C-Linda programming language is the combination of the C and the Linda languages. Linda, developed by Professor David Gelernter (Yale University), is a coordination language. It provides six functions for concurrent process coordination that can be added to any sequential programming language, conforming to that language's function call syntax. Thus, unlike with many other modern parallel languages, the Linda programmer does not need to learn an entirely new computational language, but rather only needs to learn the Linda primitives for adding concurrency to the language that the programmer is most familiar with.
Jeannette M. Wing
Professor in the School of Computer Science Associate Dean of Doctoral Programs, Software specification and verification, security, concurrent and distributed systems, programming languages, programming methodology.
http://www-2.cs.cmu.edu/~wing/

Extractions: Email: wing@cs.cmu.edu Software specification and verification security , concurrent and distributed systems programming languages programming methodology Security Measuring A System's Attack Surface , Pratyusa Manadhata and Jeannette Wing, submitted to USENIX Security 2004 , available as CMU-TR-04-102 , January 2004. Tools for Generating and Analyzing Attack Graphs , Oleg Sheyner and Jeannette Wing, to appear in Proceedings of Formal Methods for Components and Objects , Lecture Notes in Computer Science, 2005. Measuring Relative Attack Surfaces , Michael Howard, Jon Pincus, and Jeannette Wing, Proceedings of Workshop on Advanced Developments in Software and Systems Security , available as CMU-TR-03-169, August 2003.
Laboratorio De Fundamentos Da Computación E Intelixencia Artificial
Affiliated with the University of Corunna. Does research in theoretical Computer Science, programming, distributed and concurrent functional environments and formal methods in Software Engineering.
http://carpanta.dc.fi.udc.es/

Extractions: Main Page Contact Info Staff Projects ... Internal LABORATORY OF FOUNDATIONS IN COMPUTER SCIENCE AND ARTIFICIAL INTELLIGENCE LFCIA is a laboratory affiliated to the Department of Computer Science of the Faculty of Informatics of the University of Corunna Vision Artificial y Reconocimiento de Patrones ( VARPA Group web@lfcia.org Main Page Contact Info ... Internal
Distributed Haskell
Extension for parallel and distributed programming, with combinators from concurrent constraint programming; computational parts of programs are expressed functionally, development was first for tightly coupled multiprocessors, evolved from Goffin.
http://www.cse.unsw.edu.au/~chak/goffin/

Extractions: aka Goffin Haskell is the most popular lazy, functional programming language. It includes a polymophic type system that supports overloading, a powerful standard library, and a convenient, purely functional I/O system. Currently, there are three mature implementations . There is even some poetry about it. Distributed Haskell extends plain Haskell with support for concurrent computations, distribution, reactive behaviour, soft-real time constraints, and inter-application communication. The resulting language facilitates the implementation of co-ordinative structures required in applications from parallel computing as well as distributed and Internet programming. High-performance SMP servers, clustered workstations, and modern supercomputers increasingly share the same architectures; at the same time, we see that distributed computing and parallel computing are converging. It is clear that this development has a strong impact on programming models and language design for networked and high-performance machines. Distributed Haskell is designed to allow implementin many parallel and distributed applications in the same framework. Distributed Haskell evolved from Goffin, an extension of Haskell with combinators from concurrent constraint programming. These combinators constitute a co-ordination sublanguage that allows the specification of the co-ordination portion of parallel and distributed programs. The computational portions of these programs are expressed purely functional. The distinguished feature of Goffin is that the semantic properties of the functional base language Haskell are preserved; in particular, the extension retains referential transparency. Although, the development of Goffin initially focused on tightly-coupled multiprocessors, some extensions that are required for applications executing on loosely-coupled systems have been proposed recently, which inspired the change of the name into Distributed Haskell
Scsh - The Scheme Shell
A broadspectrum systems-programming environment for Unix embedded in R5RS Scheme (actually within version 0.53 of Scheme48). Support for concurrent system programming, sophisticated I/O and automatic garbage collection for process resources.
http://www.scsh.net/

Extractions: What is scsh? News Who wrote scsh? Scsh on SourceForge ... Praise scsh .net all about scsh Scsh is an open-source Unix shell embedded within Scheme , running on all major Unix platforms including AIX, Cygwin, Linux, FreeBSD, GNU Hurd, HP-UX, Irix, Mac OS X, Solaris, and some others. Scsh is a variant of Scheme 48 (an R RS Scsh has two main components: a process notation for running programs and setting up pipelines and redirections, and a complete syscall library for low-level access to the operating system, i.e. to POSIX , the least common denominator of more or less all Unices, plus widely supported extensions such as symbolic links and BSD sockets. Moreover, scsh provides an awk facility for pattern-directed computation over streams of records, a rich facility for matching regular-expression patterns in strings, event-based interrupt handling, user-level threads, a futuristic module system, and an interactive environment. Scsh comes with extensive documentation describing these and other features. The latest version of scsh is 0.6.6, released March 29, 2004. You may
Programming Java Threads In The Real World, Part 1
programming Java threads isn't nearly as easy (or as platformindependent) as most books would have you believe, and all Java programs that use the AWT are multithreaded. This article is the first
http://www.javaworld.com/javaworld/jw-09-1998/jw-09-threads.html

Extractions: Programming Java threads isn't nearly as easy (or as platform-independent) as most books would have you believe, and all Java programs that use the AWT are multithreaded. This article is the first in a series that discusses the things you need to know to program threads in the real world. The article assumes you understand the language-level support for threads (the synchronized keyword, how monitors work, the and methods, and so on) and focuses on the legion of problems that arise when you try to use these language features. (3,400 words) By Allen Holub Page 1 of 3 Advertisement ll Java programs other than simple console-based applications are multithreaded, whether you like it or not. The problem is that the Abstract Windowing Toolkit (AWT) processes operating system (OS) events on its own thread, so your listener methods actually run on the AWT thread. These same listener methods typically access objects that are also accessed from the main thread. It may be tempting, at this point, to bury your head in the sand and pretend you don't have to worry about threading issues, but you can't usually get away with it. And, unfortunately, virtually none of the books on Java addresses threading issues in sufficient depth. (For a list of helpful books on the topic, see
Concurrency - State Models & Java Programs
Concurrency State Models Java Programs.
http://www.doc.ic.ac.uk/~jnm/book/
Index Of /classes/cs522
Parent Directory 02Mar-2004 1416 - 1997/ 12-Jan-2000 1113 - 1998/ 12Index of /classes/cs522. Name Last modified Size
http://www.cs.arizona.edu/classes/cs522/

Extractions: Name Last modified Size Description ... Parent Directory 02-Mar-2004 14:16 - 12-Jan-2000 11:13 - 12-Jan-2000 11:13 - 12-Jan-2000 11:12 - 21-Mar-2001 14:05 - 25-Oct-2003 09:26 - 30-Oct-2002 16:26 - 06-Mar-2002 17:00 - 02-Oct-2001 14:09 - 30-Oct-2002 16:26 - 30-Oct-2002 16:26 - 30-Oct-2002 16:26 - 30-Oct-2002 16:26 - Apache/1.3.31 Server at www.cs.arizona.edu Port 80

A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

121-140 of 140 Back | 1 | 2 | 3 | 4 | 5 | 6 | 7