Search Results for "open message queue"

flatcc has no external dependencies except for build and compiler tools, and the C runtime library. With concurrent Ninja builds, a small client project can build flatcc with libraries, generate schema code, link the project and execute a test case in a few seconds, produce binaries between 15K and 60K, read small buffers in 30ns, build FlatBuffers in about 600ns, and with a larger executable also handle optional json parsing or printing in less than 2 us for a 10 field mixed type message....

ELENA is a general-purpose, pure object-oriented language with late binding. It promotes more object-oriented program design, reusable and more standardized code. The package includes compiler, IDE, ELENA libraries and samples

X10 is a class-based, strongly-typed, garbage-collected, object-oriented language. To support concurrency and distribution, X10 uses the Asynchronous Partitioned Global Address Space programming model (APGAS). This model introduces two key concepts -- places and asynchronous tasks -- and a few mechanisms for coordination. With these, APGAS can express both regular and irregular parallelism, message-passing-style and active-message-style computations, fork-join and bulk-synchronous...

Based on boost. Thread:mutex-condition queue and map,ACE style thread and Glib style thread pool, loop task. Memory:memory pool. COM:COM object invocation. Language:compiler lexical and grammar analysis. Network:epoll reactor.

Que is a queue-based programming language, very different from other programming languages. Due to the nature of a queue, programs made in Que are automatically parallelized, meaning improved efficiency in multi-core environments.

Stalk is a new prototyping, message-passing OO language similar to Self. The interpreter compiles source text to bytecode for the Stalk Virtual Machine (SVM) and caches it. Compilable on most systems with sane C++ compilers, stalk has optional gtk binding

Chor is a strongly-typed choreography programming language for distributed systems. In Chor, the behaviour of a system is written down as a global program (a choreography) where all the message exchanges between the participants are explicit. Choreographies are statically checked against protocol specifications, given as types, enabling type-directed global programming. Finally, Chor supports the automatic generation of systems from a choreography. With Chor, you do not have to worry about...