BibTeX Proceedings details

BibTex html text dump of PaperDB database.

PaperDB is GPL Software, see: http://paperdb.sourceforge.net.

@InProceedings{East05,
  title = "{I}nterfacing with {H}oneysuckle by {F}ormal {C}ontract",
  author= "East, Ian R.",
  editor= "Broenink, Jan F. and Roebbers, Herman and Sunter, Johan P. E. and Welch, Peter H. and Wood, David C.",
  pages = "1--11",
  booktitle= "{C}ommunicating {P}rocess {A}rchitectures 2005",
  isbn= "978-1-58603-561-7",
  year= "2005",
  month= "sep",
  abstract= "Honeysuckle is a new programming language that allows
     systems to be constructed from processes which communicate
     under service (client-server or master-servant) protocol.
     The model for abstraction includes a formal definition of
     both service and service-network (system or component). Any
     interface between two components thus forms a binding
     contract which will be statically verified by the compiler.
     An account is given of how such an interface is constructed
     and expressed in Honeysuckle, including how it may
     encapsulate state, and how access may be shared and
     distributed. Implementation is also briefly discussed."
}
@InProceedings{Kerridge05,
  title = "{G}roovy {P}arallel! {A} {R}eturn to the {S}pirit of occam?",
  author= "Kerridge, Jon and Barclay, Ken and Savage, John",
  editor= "Broenink, Jan F. and Roebbers, Herman and Sunter, Johan P. E. and Welch, Peter H. and Wood, David C.",
  pages = "13--28",
  booktitle= "{C}ommunicating {P}rocess {A}rchitectures 2005",
  isbn= "978-1-58603-561-7",
  year= "2005",
  month= "sep",
  abstract= "For some years there has been much activity in developing
     CSP-like extensions to a number of common programming
     languages. In particular, a number of groups have looked at
     extensions to Java. Recent developments in the Java platform
     have resulted in groups proposing more expressive problem
     solving environments. Groovy is one of these developments.
     Four constructs are proposed that support the writing of
     parallel systems using the JCSP package. The use of these
     constructs is then demonstrated in a number of examples,
     both concurrent and parallel. A mechanism for writing XML
     descriptions of concurrent systems is described and it is
     shown how this is integrated into the Groovy environment.
     Finally conclusions are drawn relating to the use of the
     constructs, particularly in a teaching and learning
     environment."
}
@InProceedings{Jovanovic05,
  title = "{O}n {I}ssues of {C}onstructing an {E}xception {H}andling {M}echanism for {CSP}-{B}ased {P}rocess-{O}riented {C}oncurrent {S}oftware",
  author= "Jovanovic, Dusko S. and Orlic, Bojan and Broenink, Jan F.",
  editor= "Broenink, Jan F. and Roebbers, Herman and Sunter, Johan P. E. and Welch, Peter H. and Wood, David C.",
  pages = "29--41",
  booktitle= "{C}ommunicating {P}rocess {A}rchitectures 2005",
  isbn= "978-1-58603-561-7",
  year= "2005",
  month= "sep",
  abstract= "This paper discusses issues, possibilities and existing
     approaches for fitting an exception handling mechanism (EHM)
     in CSP-based process-oriented software architectures. After
     giving a survey on properties desired for a concurrent EHM,
     specific problems and a few principal ideas for including
     exception handling facilities in CSP-designs are discussed.
     As one of the CSP-based frameworks for concurrent software,
     we extend CT (Communicating Threads) library with the
     exception handling facilities. The extensions result in two
     different EHM models whose compliance with the most
     important demands of concurrent EHMs (handling simultaneous
     exceptions, the mechanism formalization and efficient
     implementation) are observed."
}
@InProceedings{Rem05,
  title = "{A}utomatic {H}andel-{C} {G}eneration from {MATLAB}® and {S}imulink® for {M}otion {C}ontrol with an {FPGA}",
  author= "Rem, Bart and Gopalakrishnan, Ajeesh and Geelen, Tom J. H. and Roebbers, Herman",
  editor= "Broenink, Jan F. and Roebbers, Herman and Sunter, Johan P. E. and Welch, Peter H. and Wood, David C.",
  pages = "43--69",
  booktitle= "{C}ommunicating {P}rocess {A}rchitectures 2005",
  isbn= "978-1-58603-561-7",
  year= "2005",
  month= "sep",
  abstract= "In this paper, we demonstrate a structured approach to
     proceed from development in a high level-modeling
     environment to testing on the real hardware. The concept is
     introduced by taking an example scenario that involves
     automatic code generation of Handel-C for FPGAs. The entire
     process is substantiated with a prototype that generates
     Handel-C code from MATLAB®/Simulink® for most common
     Simulink® blocks. Furthermore, we establish the potential
     of the notion by generating Handel-C for an FPGA, which
     controls the flow of paper through the scanning section of a
     printer/copier. Additionally, we present another method to
     generate Handel-C from a state-based specification. Finally,
     to verify and validate the behavior of the generated code,
     we execute several levels of simulation, including
     software-in-the-loop and hardware-in-the-loop simulations."
}
@InProceedings{SputhAllen05,
  title = "{JCSP}-{P}oison: {S}afe {T}ermination of {CSP} {P}rocess {N}etworks",
  author= "Sputh, Bernhard H.C. and Allen, Alastair R.",
  editor= "Broenink, Jan F. and Roebbers, Herman and Sunter, Johan P. E. and Welch, Peter H. and Wood, David C.",
  pages = "71--107",
  booktitle= "{C}ommunicating {P}rocess {A}rchitectures 2005",
  isbn= "978-1-58603-561-7",
  year= "2005",
  month= "sep",
  abstract= "This paper presents a novel technique for safe partial or
     complete process network termination. The idea is to have
     two types of termination messages / poison: LocalPoison and
     GlobalPoison. Injecting GlobalPoison into a process network
     results in a safe termination of the whole process network.
     In contrast, injected LocalPoison only terminates all
     processes until it is filtered out by Poison-Filtering
     Channels. This allows the creation of termination domains
     inside a process network. To make handling of a termination
     message easy, it is delivered as an exception and not as a
     normal message. The necessary Poisonable- and
     Poison-Filtering-Channels have been modelled in CSP and
     checked using FDR. A proof of concept implementation for
     Communicating Sequential Processes for Java (JCSP) has been
     developed and refined. Previously, JCSP offered no safe way
     to terminate the process network. When the user terminated
     the program, the Java Virtual Machine (JVM) simply stops all
     threads (processes), without giving the processes the chance
     to perform clean up operations. A similar technique is used
     to perform partial termination of process networks in JCSP,
     making it unsafe as well. The technique presented in this
     paper is not limited to JCSP, but can easily be ported to
     other CSP environments. Partial process network termination
     can be applied in the area of Software Defined Radio (SDR),
     because SDR systems need to be able to change their signal
     processing algorithms during runtime."
}
@InProceedings{ChalmersKerridge05,
  title = "jcsp.mobile: {A} {P}ackage {E}nabling {M}obile {P}rocesses and {C}hannels",
  author= "Chalmers, Kevin and Kerridge, Jon",
  editor= "Broenink, Jan F. and Roebbers, Herman and Sunter, Johan P. E. and Welch, Peter H. and Wood, David C.",
  pages = "109--127",
  booktitle= "{C}ommunicating {P}rocess {A}rchitectures 2005",
  isbn= "978-1-58603-561-7",
  year= "2005",
  month= "sep",
  abstract= "The JCSPNet package from Quickstone provides the capability
     of transparently creating a network of processes that run
     across a TCP/IP network. The package also contains
     mechanisms for creating mobile processes and channels
     through the use of filters and the class Dynamic Class
     Loader, though their precise use is not well documented. The
     package jcsp.mobile rectifies this position and provides a
     set of classes and interfaces that facilitates the
     implementation of systems that use mobile processes and
     channels. In addition, the ability to migrate processes and
     channels from one processor to another is also implemented.
     The capability is demonstrated using a multi-user game
     running on an ad-hoc wireless network using a workstation
     and four PDAs."
}
@InProceedings{Gardner05,
  title = "{CSP}++: {H}ow {F}aithful to {CSP}m?",
  author= "Gardner, W. B.",
  editor= "Broenink, Jan F. and Roebbers, Herman and Sunter, Johan P. E. and Welch, Peter H. and Wood, David C.",
  pages = "129--146",
  booktitle= "{C}ommunicating {P}rocess {A}rchitectures 2005",
  isbn= "978-1-58603-561-7",
  year= "2005",
  month= "sep",
  abstract= "CSP++ is a tool that makes specifications written in CSPm
     executable and extensible. It is the basis for a technique
     called selective formalism, which allows part of a system to
     be designed in verifiable CSPm statements, automatically
     translated into C++, and linked with functions coded in C++.
     This paper describes in detail the subset of CSPm that can
     be accurately translated by CSP++, and how the CSP semantics
     are achieved by the runtime framework. It also explains
     restrictions that apply to coding in CSPm for software
     synthesis, and the rationale for those restrictions."
}
@InProceedings{Schoute05,
  title = "{F}ast {D}ata {S}haring within a {D}istributed, {M}ultithreaded {C}ontrol {F}ramework for {R}obot {T}eams",
  author= "Schoute, Albert L. and Seesink, Remco and Dierssen, Werner and Kooij, Niek",
  editor= "Broenink, Jan F. and Roebbers, Herman and Sunter, Johan P. E. and Welch, Peter H. and Wood, David C.",
  pages = "147--154",
  booktitle= "{C}ommunicating {P}rocess {A}rchitectures 2005",
  isbn= "978-1-58603-561-7",
  year= "2005",
  month= "sep",
  abstract= "In this paper a data sharing framework for multi-threaded,
     distributed control programs is described that is realized
     in C++ by means of only a few, powerful classes and
     templates. Fast data exchange of entire data structures is
     supported using sockets as communication medium. Access
     methods are provided that preserve data consistency and
     synchronize the data exchange. The framework has been
     successfully used to build a distributed robot soccer
     control system running on as many computers as needed."
}
@InProceedings{HappeVinter05,
  title = "{I}mproving {TCP}/{IP} {M}ulticasting with {M}essage {S}egmentation",
  author= "Happe, Hans Henrik and Vinter, Brian",
  editor= "Broenink, Jan F. and Roebbers, Herman and Sunter, Johan P. E. and Welch, Peter H. and Wood, David C.",
  pages = "155--163",
  booktitle= "{C}ommunicating {P}rocess {A}rchitectures 2005",
  isbn= "978-1-58603-561-7",
  year= "2005",
  month= "sep",
  abstract= "Multicasting is a very important operation in high
     performance parallel applications. Making this operation
     efficient in supercomputers has been a topic of great
     concern. Much effort has gone into designing special
     interconnects to support the operation. Today\&\#8217;s huge
     deployment of NoWs (Network of Workstations) has created a
     high demand for efficient software-based multicast
     solutions. These systems are often based on low-cost
     Ethernet interconnects without direct support for group
     communication. Basically TCP/IP is the only widely supported
     method of fast reliable communication, though it is possible
     to improve Ethernet performance at many levels \&\#8211;
     i.e., by-passing the operating system or using physical
     broadcasting. Low-level improvements are not likely to be
     accepted in production environments, which leaves TCP/IP as
     the best overall choice for group communication. In this
     paper we describe a TCP/IP based multicasting algorithm that
     uses message segmentation in order to lower the propagation
     delay. Experiments have shown that TCP is very inefficient
     when a node has many active connections. With this in mind
     we have designed the algorithm so that it has a worst-case
     propagation path length of O(log n) with a minimum of
     connections per node. We compare our algorithm with the
     binomial tree algorithm often used in TCP/IP MPI
     implementations."
}
@InProceedings{Sampson05,
  title = "{L}azy {C}ellular {A}utomata with {C}ommunicating {P}rocesses",
  author= "Sampson, Adam T. and Welch, Peter H. and Barnes, Frederick R. M.",
  editor= "Broenink, Jan F. and Roebbers, Herman and Sunter, Johan P. E. and Welch, Peter H. and Wood, David C.",
  pages = "165--175",
  booktitle= "{C}ommunicating {P}rocess {A}rchitectures 2005",
  isbn= "978-1-58603-561-7",
  year= "2005",
  month= "sep",
  abstract= "Cellular automata (CAs) are good examples of systems in
     which large numbers of autonomous entities exhibit emergent
     behaviour.Using the occam-pi and JCSP communicating process
     systems, we show how to construct \&\#8220;lazy\&\#8221; and
     \&\#8220;just-in-time\&\#8221; models of cellular automata,
     which permit very efficient parallel simulation of sparse CA
     populations on shared-memory and distributed systems."
}
@InProceedings{Smith05,
  title = "{A} {U}nifying {T}heory of {T}rue {C}oncurrency {B}ased on {CSP} and {L}azy {O}bservation",
  author= "Smith, Marc L.",
  editor= "Broenink, Jan F. and Roebbers, Herman and Sunter, Johan P. E. and Welch, Peter H. and Wood, David C.",
  pages = "177--188",
  booktitle= "{C}ommunicating {P}rocess {A}rchitectures 2005",
  isbn= "978-1-58603-561-7",
  year= "2005",
  month= "sep",
  abstract= "What if the CSP observer were lazy? This paper considers the
     consequences of altering the behavior of the CSP observer.
     Specifically, what implications would this new behavior have
     on CSP\&\#8217;s traces? Laziness turns out to be a useful
     metaphor. We show how laziness permits transforming CSP into
     a model of true concurrency (i.e., non-interleaved trace
     semantics). Furthermore, the notion of a lazy observer
     supports tenets of view-centric reasoning (VCR): parallel
     events (i.e., true concurrency), multiple observers (i.e.,
     different views), and the possibility of imperfect
     observation. We know from the study of programming languages
     that laziness is not necessarily a negative quality; it
     provides the possibility of greater expression and power in
     the programswe write. Similarly, within the context of the
     Unifying Theories of Programming, a model of true
     concurrency\&\#8212; VCR \&\#8212; becomes possible by
     permitting (even encouraging) the CSP observer to be lazy."
}
@InProceedings{Vinter05,
  title = "{T}he {A}rchitecture of the {M}inimum intrusion {G}rid ({M}i{G})",
  author= "Vinter, Brian",
  editor= "Broenink, Jan F. and Roebbers, Herman and Sunter, Johan P. E. and Welch, Peter H. and Wood, David C.",
  pages = "189--201",
  booktitle= "{C}ommunicating {P}rocess {A}rchitectures 2005",
  isbn= "978-1-58603-561-7",
  year= "2005",
  month= "sep",
  abstract= "This paper introduces the philosophy behind a new Grid
     model, the Minimum intrusion Grid, MiG. The idea behind MiG
     is to introduce a \&\#8216;fat\&\#8217; Grid infrastructure
     which will allow much \&\#8216;slimmer\&\#8217; Grid
     installations on both the user and resource side. This paper
     presents the ideas of MiG, some initial designs and finally
     a status report of the implementation."
}
@InProceedings{Klebanov05,
  title = "{V}erification of {JCSP} {P}rograms",
  author= "Klebanov, Vladimir and Rümmer, Philipp and Schlager, Steffen and Schmitt, Peter H.",
  editor= "Broenink, Jan F. and Roebbers, Herman and Sunter, Johan P. E. and Welch, Peter H. and Wood, David C.",
  pages = "203--218",
  booktitle= "{C}ommunicating {P}rocess {A}rchitectures 2005",
  isbn= "978-1-58603-561-7",
  year= "2005",
  month= "sep",
  abstract= "We describe the first proof system for concurrent programs
     based on Communicating Sequential Processes for Java (JCSP).
     The system extends a complete calculus for the JavaCard
     Dynamic Logic with support for JCSP, which is modeled in
     terms of the CSP process algebra. Together with a novel
     efficient calculus for CSP, a rule system is obtained that
     enables JCSP programs to be executed symbolically and to be
     checked against temporal properties. The proof system has
     been implemented within the KeY tool and is publicly
     available."
}
@InProceedings{Wiggers05,
  title = "{A}rchitecture {D}esign {S}pace {E}xploration for {S}treaming {A}pplications through {T}iming {A}nalysis",
  author= "Wiggers, Maarten H. and Kavaldjiev, Nikolay and Smit, Gerard J. M. and Jansen, Pierre G.",
  editor= "Broenink, Jan F. and Roebbers, Herman and Sunter, Johan P. E. and Welch, Peter H. and Wood, David C.",
  pages = "219--233",
  booktitle= "{C}ommunicating {P}rocess {A}rchitectures 2005",
  isbn= "978-1-58603-561-7",
  year= "2005",
  month= "sep",
  abstract= "In this paper we compare the maximum achievable throughput
     of different memory organisations of the processing elements
     that constitute a multiprocessor system on chip. This is
     done by modelling the mapping of a task with input and
     output channels on a processing element as a homogeneous
     synchronous dataflow graph, and use maximum cycle mean
     analysis to derive the throughput. In a HiperLAN\2 case
     study we show how these techniques can be used to derive the
     required clock frequency and communication latencies in
     order to meet the application\&\#8217;s throughput
     requirement on a multiprocessor system on chip that has one
     of the investigated memory organisations."
}
@InProceedings{DimmichJacobsen05,
  title = "{A} {F}oreign {F}unction {I}nterface {G}enerator for occam-pi",
  author= "Dimmich, Damian J. and Jacobsen, Christian L.",
  editor= "Broenink, Jan F. and Roebbers, Herman and Sunter, Johan P. E. and Welch, Peter H. and Wood, David C.",
  pages = "235--248",
  booktitle= "{C}ommunicating {P}rocess {A}rchitectures 2005",
  isbn= "978-1-58603-561-7",
  year= "2005",
  month= "sep",
  abstract= "occam-pi is a programming language based on the CSP process
     algebra and the pi-calculus, and has a powerful syntax for
     expressing concurrency. occam-pi does not however, come with
     interfaces to a broad range of standard libraries (such as
     those used for graphics or mathematics). Programmers wishing
     to use these must write their own wrappers using
     occam-pi’s foreign function interface, which can be
     tedious and time consuming. SWIG offers automatic generation
     of wrappers for libraries written in C and C++, allowing
     access to these for the target languages supported by SWIG.
     This paper describes the occam-pi module for SWIG, which
     will allow automatic wrapper generation for occam-pi, and
     will ensure that occam-pi’s library base can be grown in a
     quick and efficient manner. Access to database, graphics and
     hardware interfacing libraries can all be provided with
     relative ease when using SWIG to automate the bulk of the
     work."
}
@InProceedings{Barnes05,
  title = "{I}nterfacing {C} and occam-pi",
  author= "Barnes, Frederick R. M.",
  editor= "Broenink, Jan F. and Roebbers, Herman and Sunter, Johan P. E. and Welch, Peter H. and Wood, David C.",
  pages = "249--260",
  booktitle= "{C}ommunicating {P}rocess {A}rchitectures 2005",
  isbn= "978-1-58603-561-7",
  year= "2005",
  month= "sep",
}
@InProceedings{Bjorndalen05,
  title = "{I}nteractive {C}omputing with the {M}inimum intrusion {G}rid ({M}i{G})",
  author= "Bjørndalen, John Markus and Anshus, Otto J. and Vinter, Brian",
  editor= "Broenink, Jan F. and Roebbers, Herman and Sunter, Johan P. E. and Welch, Peter H. and Wood, David C.",
  pages = "261--273",
  booktitle= "{C}ommunicating {P}rocess {A}rchitectures 2005",
  isbn= "978-1-58603-561-7",
  year= "2005",
  month= "sep",
  abstract= "Grid computing is finally starting to provide solutions for
     capacity computing, that is problem solving where there is a
     large number of independent tasks for execution. This paper
     describes the experiences with using Grid for capability
     computing, i.e. solving a single task efficiently. The
     chosen capability application is driving a very large
     display which requires enormous processing power due to its
     huge graphic resolution (7168 x 3072 pixels). Though we use
     an advanced Grid middleware, the conclusion is that new
     features are required to provide such coordinated
     calculations as the present application requires."
}
@InProceedings{SaifhashemiBeerel05,
  title = "{H}igh {L}evel {M}odeling of {C}hannel-{B}ased {A}synchronous {C}ircuits {U}sing {V}erilog",
  author= "Saifhashemi, Arash and Beerel, Peter A.",
  editor= "Broenink, Jan F. and Roebbers, Herman and Sunter, Johan P. E. and Welch, Peter H. and Wood, David C.",
  pages = "275--288",
  booktitle= "{C}ommunicating {P}rocess {A}rchitectures 2005",
  isbn= "978-1-58603-561-7",
  year= "2005",
  month= "sep",
  abstract= "In this paper we describe a method for modeling
     channel-based asynchronous circuits using Verilog HDL. We
     suggest a method to model CSP-like channels in Verilog HDL.
     This method also describes nonlinear pipelines and high
     level channel timing properties, such as forward and
     backward latencies, minimum cycle time, and slack. Using
     Verilog enables us to describe the circuit at many levels of
     abstraction and to use the commercially available CAD tools."
}
@InProceedings{WelchBarnes05,
  title = "{M}obile {B}arriers for occam-pi: {S}emantics, {I}mplementation and {A}pplication",
  author= "Welch, Peter H. and Barnes, Frederick R. M.",
  editor= "Broenink, Jan F. and Roebbers, Herman and Sunter, Johan P. E. and Welch, Peter H. and Wood, David C.",
  pages = "289--316",
  booktitle= "{C}ommunicating {P}rocess {A}rchitectures 2005",
  isbn= "978-1-58603-561-7",
  year= "2005",
  month= "sep",
  abstract= "This paper introduces a safe language binding for CSP
     multiway events (barriers\&\#8212;both static and mobile)
     that has been built into occam-pi (an extension of the
     classical occam language with dynamic parallelism, mobile
     processes and mobile channels). Barriers provide a simple
     way for synchronising multiple processes and are the
     fundamental control mechanism underlying both CSP
     (Communicating Sequential Processes) and BSP (Bulk
     Synchronous Parallelism). Formal semantics (through
     modelling in classical CSP), implementation details and
     early performance benchmarks (16 nanoseconds per process per
     barrier synchronisation on a 3.2 GHz Pentium IV) are
     presented, along with some likely directions for future
     research. Applications are outlined for the fine-grained
     modelling of dynamic systems, where barriers are used for
     maintaining simulation time and the phased execution of time
     steps, coordinating safe and desired patterns of
     communication between millions (and more) of processes. This
     work forms part of our TUNA project, investigating emergent
     properties in large dynamic systems (nanite assemblies)."
}
@InProceedings{Hilderink05,
  title = "{E}xception {H}andling {M}echanism in {C}ommunicating {T}hreads for {J}ava",
  author= "Hilderink, Gerald H.",
  editor= "Broenink, Jan F. and Roebbers, Herman and Sunter, Johan P. E. and Welch, Peter H. and Wood, David C.",
  pages = "317--334",
  booktitle= "{C}ommunicating {P}rocess {A}rchitectures 2005",
  isbn= "978-1-58603-561-7",
  year= "2005",
  month= "sep",
  abstract= "The concept of exception handling is important for building
     reliable software. An exception construct is proposed in
     this paper, which implements an exception handling mechanism
     that is suitable for concurrent software architectures. The
     aim of this exception construct is to bring exception
     handling to a high-level of abstraction such that exception
     handling does scale well with the complexity of the system.
     This is why the exception construct supports a CSP-based
     software design approach. The proposed exception construct
     embraces informal semantics, but which are intuitive and
     suitable to software engineering. The exception construct is
     prototyped in the CSP for Java library, called CTJ."
}
@InProceedings{Jakson05,
  title = "{R}16: a {N}ew {T}ransputer {D}esign for {FPGA}s",
  author= "Jakson, John",
  editor= "Broenink, Jan F. and Roebbers, Herman and Sunter, Johan P. E. and Welch, Peter H. and Wood, David C.",
  pages = "335--362",
  booktitle= "{C}ommunicating {P}rocess {A}rchitectures 2005",
  isbn= "978-1-58603-561-7",
  year= "2005",
  month= "sep",
  abstract= "This paper describes the ongoing development of a new FPGA
     hosted Transputer using a Load Store RISC style Multi
     Threaded Architecture (MTA). The memory system throughput is
     emphasized as much as the processor throughput and uses the
     recently developed Micron 32MByte RLDRAM which can start
     fully random memory cycles every 3.3ns with 20ns latency
     when driven by an FPGA controller. The R16 shares an object
     oriented Memory Manager Unit (MMU) amongst multiple low cost
     Processor Elements (PEs) until the MMU throughput limit is
     reached. The PE has been placed and routed at over 300MHz in
     a Xilinx Virtex-II Pro device and uses around 500 FPGA basic
     cells and 1 Block RAM. The 15 stage pipeline uses 2 clocks
     per instruction to greatly simplify the hardware design
     which allows for twice the clock frequency of other FPGA
     processors. There are instruction and cycle accurate
     simulators as well as a C compiler in development. The
     compiler can now emit optimized small functions needed for
     further hardware development although compiling itself
     requires much work. Some occam and Verilog language
     components will be added to the C base to allow a mixed
     occam and event driven processing model. Eventually it is
     planned to allow occam or Verilog source to run as software
     code or be placed as synthesized co processor hardware
     attached to the MMU."
}
@InProceedings{Stewart05,
  title = "{T}owards {S}trong {M}obility in the {S}hared {S}ource {CLI}",
  author= "Stewart, Johnston and Nixon, Patrick and Walsh, Tim and Ferguson, Ian",
  editor= "Broenink, Jan F. and Roebbers, Herman and Sunter, Johan P. E. and Welch, Peter H. and Wood, David C.",
  pages = "363--373",
  booktitle= "{C}ommunicating {P}rocess {A}rchitectures 2005",
  isbn= "978-1-58603-561-7",
  year= "2005",
  month= "sep",
  abstract= "Migrating a thread while preserving its state is a useful
     mechanism to have in situations where load balancing within
     applications with intensive data processing is required.
     Strong mobility systems, however, are rarely developed or
     implemented as they introduce a number of major challenges
     into the implementation of the system. This is due to the
     fact that the underlying infrastructure that most computers
     operate on was never designed to accommodate such a system,
     and because of this it actually impedes the development of
     these systems to some degree. Using a system based around a
     virtual machine, such as Microsoft\&\#8217;s Common Language
     Runtime (CLR), circumnavigates many of these problems by
     abstracting away system differences. In this paper we
     outline the architecture of the threading mechanism in the
     shared source version of the CLR known as the Shared Source
     Common Language Infrastructure (SSCLI). We also outline how
     we are porting strong mobility into the SSCLI, taking
     advantage of its virtual machine."
}
@InProceedings{Groothuis05,
  title = "g{CSP} occam {C}ode {G}eneration for {RM}o{X}",
  author= "Groothuis, Marcel A. and Liet, Geert K. and Broenink, Jan F.",
  editor= "Broenink, Jan F. and Roebbers, Herman and Sunter, Johan P. E. and Welch, Peter H. and Wood, David C.",
  pages = "375--383",
  booktitle= "{C}ommunicating {P}rocess {A}rchitectures 2005",
  isbn= "978-1-58603-561-7",
  year= "2005",
  month= "sep",
  abstract= "gCSP is a graphical tool for creating and editing CSP
     diagrams. gCSP is used in our labs to generate the embedded
     software framework for our control systems. As a further
     extension to our gCSP tool, an occam code generator has been
     constructed. Generating occam from CSP diagrams gives
     opportunities to use the Raw-Metal occam eXperiment (RMoX)
     as a minimal operating system on the embedded control PCs in
     our mechatronics laboratory. In addition, all processors
     supported by KRoC can be reached from our graphical CSP
     tool. The commstime benchmark is used to show the trajectory
     for gCSP code generation for the RMoX operating system. The
     result is a simple means for using RMoX in our laboratory
     for our control systems. We want to use RMoX for future
     research on distributed control and for performance
     comparisons between a minimal operating system and our
     CTC++/RT-linux systems."
}
@InProceedings{Ivanovici05,
  title = "{A}ssessing {A}pplication {P}erformance in {D}egraded {N}etwork {E}nvironments: an {FPGA}-based {A}pproach",
  author= "Ivanovici, Mihai and Beuran, Razvan and Davies, Neil",
  editor= "Broenink, Jan F. and Roebbers, Herman and Sunter, Johan P. E. and Welch, Peter H. and Wood, David C.",
  pages = "385--395",
  booktitle= "{C}ommunicating {P}rocess {A}rchitectures 2005",
  isbn= "978-1-58603-561-7",
  year= "2005",
  month= "sep",
  abstract= "Network emulation is a technique that allows
     real-application performance assessment under controllable
     and reproducible conditions. We designed and implemented a
     hardware network emulator on an FPGA-based custom-design PCI
     platform. Implementation was facilitated by the use of the
     Handel-C programming language, that allows rapid development
     and fast translation into hardware and has specific
     constructs for developing systems with concurrent processes.
     We report on tests performed with web-browsing applications."
}
@InProceedings{Hofstee05,
  title = "{C}ommunication and {S}ynchronisation in the {C}ell {P}rocessor",
  author= "Hofstee, H. Peter",
  editor= "Broenink, Jan F. and Roebbers, Herman and Sunter, Johan P. E. and Welch, Peter H. and Wood, David C.",
  pages = "397--397",
  booktitle= "{C}ommunicating {P}rocess {A}rchitectures 2005",
  isbn= "978-1-58603-561-7",
  year= "2005",
  month= "sep",
}
@InProceedings{Stravers05,
  title = "{H}omogeneous {M}ultiprocessing for {C}onsumer {E}lectronics",
  author= "Stravers, Paul",
  editor= "Broenink, Jan F. and Roebbers, Herman and Sunter, Johan P. E. and Welch, Peter H. and Wood, David C.",
  pages = "399--399",
  booktitle= "{C}ommunicating {P}rocess {A}rchitectures 2005",
  isbn= "978-1-58603-561-7",
  year= "2005",
  month= "sep",
}
@InProceedings{Peeters05,
  title = "{H}andshake {T}echnology: {H}igh {W}ay to {L}ow {P}ower",
  author= "Peeters, Ad",
  editor= "Broenink, Jan F. and Roebbers, Herman and Sunter, Johan P. E. and Welch, Peter H. and Wood, David C.",
  pages = "401--401",
  booktitle= "{C}ommunicating {P}rocess {A}rchitectures 2005",
  isbn= "978-1-58603-561-7",
  year= "2005",
  month= "sep",
}
@InProceedings{Broadfoot05,
  title = "{I}f {C}oncurrency in {S}oftware is {S}o {S}imple, {W}hy is it {S}o {H}ard?",
  author= "Broadfoot, Guy",
  editor= "Broenink, Jan F. and Roebbers, Herman and Sunter, Johan P. E. and Welch, Peter H. and Wood, David C.",
  pages = "403--403",
  booktitle= "{C}ommunicating {P}rocess {A}rchitectures 2005",
  isbn= "978-1-58603-561-7",
  year= "2005",
  month= "sep",
}

If you have any comments on this database, including inaccuracies, requests to remove or add information, or suggestions for improvement, the WoTUG web team are happy to hear of them. We will do our best to resolve problems to everyone's satisfaction.

Copyright for the papers presented in this database normally resides with the authors; please contact them directly for more information. Addresses are normally presented in the full paper.