A. AuYoung, B. Chun, A. Snoeren & A. Vahdat (2004):
Resource allocation in federated distributed computing infrastructures.
In: 1st Workshop on Op Systems and Architectural Support for Ondemand IT InfraStructure.
Available at http://www.cs.ucsd.edu/~aauyoung/papers/bellagio-oasis04.pdf.
P. Baldan, C. Bertolissi, H. Cirstea & C. Kirchner (2007):
A Rewriting Calculus for Cyclic Higher-Order Term Graphs.
Math. Structures in Computer Science 17,
pp. 363–406,
doi:10.1017/S0960129507006093.
S. Balon & G. Leduc (2006):
Dividing the Traffic Matrix to Approach Optimal Traffic Engineering.
In: 14th IEEE Int'l Conf. on Networks (ICON 2006) 2,
pp. 566–571.
G. Barthe, H. Cirstea, C. Kirchner & L. Liquori (2003):
Pure Patterns Type Systems.
In: Proc. 30th ACM Symp. on POPL,
pp. 250–261,
doi:10.1145/640128.604152.
A. Bestavros, A. Kfoury, A. Lapets & M. Ocean (2009):
Safe Compositional Network Sketches: Tool and Use Cases.
In: IEEE Workshop on Compositional Theory and Technology for Real-Time Embedded Systems,
Wash D.C..
Available at http://www.cs.bu.edu/fac/best/res/papers/crts09.pdf.
A. Bestavros, A. Kfoury, A. Lapets & M. Ocean (2010):
Safe Compositional Network Sketches: The Formal Framework.
In: 13th ACM HSCC,
Stockholm.
Available at http://www.cs.bu.edu/fac/best/res/papers/hscc10.pdf.
J.-Y. Le Boudec & P. Thiran (2004):
Network Calculus.
Springer Verlag,
doi:10.1007/3-540-45318-0.
LNCS 2050.
R. Buyya, D. Abramson & J. Giddy (2000):
Nimrod/G: An Architecture for a Resource Management and Scheduling System in a Global Computational Grid.
In: HPC ASIA 2000.
Available at http://www.gridbus.org/papers/nimrodg.pdf.
H. Cirstea, C. Kirchner & L. Liquori (2004):
Rewriting Calculus with(out) Types.
Electronic Notes in Theoretical Computer Science 71,
pp. 3–19,
doi:10.1016/S1571-0661(05)82526-5.
H. Cirstea, L. Liquori & B. Wack (2003):
Rewriting Calculus with Fixpoints: Untyped and First-order Systems.
In: Post-proceedings of TYPES, LNCS.
Springer,
pp. 147–161.
P. Cousot (1997):
Types as Abstract Interpretations, invited paper.
In: Proc. of 24th ACM Symp. on Principles of Programming Languages,
Paris,
pp. 316–331.
P. Cousot & N. Halbwachs (1978):
Automatic Discovery of Linear Restraints Among Variables of a Program.
In: Proc. 5th ACM Symp. on POPL,
Tucson,
pp. 84–96.
W. H. Cunningham (1979):
Theoretical Properties of the Network Simplex Method.
Mathematics of Operations Research 4(2),
pp. 196–208.
J. Gomoluch & M. Schroeder (2004):
Performance evaluation of market-based resource allocation for Grid computing.
Concurrency and Computation: Practice and Experience 16(5),
pp. 469–475,
doi:10.1002/cpe.826.
N. Halbwachs (1993):
Delay Analysis in Synchronous Programs.
In: Fifth Conference on Computer-Aided Verification.
LNCS 697, Springer Verlag,
Elounda (Greece).
V. Ishakian, A. Bestavros & A. Kfoury (2010):
A Type-Theoretic Framework for Efficient and Safe Colocation of Periodic Real-time Systems.
In: Int'l Conf on Embedded and Real-Time Computing Systems and Applications (RTSCA'10),
Macau, China.
Available at http://www.cs.bu.edu/fac/best/res/papers/rtsca10.pdf.
V. Ishakian, R. Sweha, J. Londono & A. Bestavros (2010):
Colocation as a Service: Strategic and Operational Services for Cloud Colocation.
In: Int'l Symp on Network Computing and Applications (NCA'10),
Cambridge, MA.
Available at http://www.cs.bu.edu/fac/best/res/papers/nca10.pdf.
C. Barry Jay & D. Kesner (2006):
Pure Pattern Calculus.
In: European Symposium on Programming,
pp. 100–114.
A. Kfoury (2011):
A Domain-Specific Language for Incremental and Modular Design of Large-Scale Verifiably-Safe Flow Networks (Part 1).
Technical Report BUCS-TR-2011-011.
CS Dept, Boston Univ.
E. Knightly & H. Zhang (1997):
D-BIND: an accurate traffic model for providing QoS guarantees to VBR traffic.
IEEE/ACM Transactions on Networking 5,
pp. 219–231,
doi:10.1109/90.588085.
C. L. Liu & James W. Layland (1973):
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment.
Journal of the ACM 20(1),
pp. 46–61,
doi:10.1145/321738.321743.
H. Rashidi & E.P.K. Tsang (2009):
An Efficient Extension of Network Simplex Algorithm.
Journal of Industrial Engineering 2,
pp. 1–9.
J. Regehr & J.A. Stankovic (2001):
HLS: A Framework for Composing Soft Real-Time Schedulers.
In: 22nd IEEE Real-Time Systems Symposium (RTSS '01).
IEEE Comp Soc,
Washington, DC, USA,
pp. 3.
I. Shin & I. Lee (2003):
Periodic Resource Model for Compositional Real-Time Guarantees.
In: 24th IEEE International Real-Time Systems Symposium (RTSS '03).
IEEE Comp Soc,
Washington, DC, USA,
pp. 2.
N. Soule, A. Bestavros, A. Kfoury & A. Lapets (2011):
Safe Compositional Equation-based Modeling of Constrained Flow Networks.
In: Proc. of 4th Int'l Workshop on Equation-Based Object-Oriented Modeling Languages and Tools,
Zürich.
P. Thiran, J. Boudec & F. Worm (2001):
Network calculus applied to optimal multimedia smoothing.
In: Proceedings of IEEE INFOCOM.
R. Wolski, J.S. Plank, J. Brevik & T. Bryan (2001):
G-commerce: Market Formulations Controlling Resource Allocation on the Computational Grid.
In: 15th Int'l Parallel & Distributed Processing Symposium (IPDPS '01).
IEEE Comp Soc,
Washington, DC, USA,
pp. 46.
eptcs@eptcs.org