Name
Abstract | ||
|---|---|---|
A language in which discrete event simulations can be coded needs to support the features (1) to describe behavior of a single physical process, (2) to describe concurrent ctivities of multiple physical processes, including communication, synchronization and interruption, (3) to account for passage of time, and (4) to record system state at appropriate points and create statistical summaries. Orc, a recent language for orchestration of distributed services, combines these features so that complex simulations can be expressed very succinctly. This talk describes the relevant features of Orc for simulation and illustrates them using a number of realistic examples. Additionally, we show that certain combinatorial problems, such as shortest paths in graphs and many problems in computational geometry, can be cast as simulation problems, and solved very simply in Orc. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/978-3-540-68237-0_4 | FM |
Keywords | Field | DocType |
discrete event simulation,computational geometry,certain combinatorial problem,appropriate point,recent language,complex simulation,multiple physical process,simulation problem,logical clocks,concurrent ctivities,single physical process,shortest path | Graph,Synchronization,Computer science,Computational geometry,Logical clock,Theoretical computer science,Orchestration (computing),Distributed services | Conference |
Volume | ISSN | Citations |
5014 | 0302-9743 | 0 |
PageRank | References | Authors |
0.34 | 1 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| David Kitchen | 1 | 0 | 0.34 |
| Evan Powell | 2 | 2 | 0.71 |
| Jayadev Misra | 3 | 3147 | 771.78 |