| 2008 |
|---|
| 116 | EE | K. Mani Chandy,
Sayan Mitra,
Concetta Pilotto:
Convergence Verification: From Shared Memory to Partially Synchronous Systems.
FORMATS 2008: 218-232 |
| 115 | EE | Sayan Mitra,
K. Mani Chandy:
A Formalized Theory for Verifying Stability and Convergence of Automata in PVS.
TPHOLs 2008: 230-245 |
| 2007 |
|---|
| 114 | | K. Mani Chandy,
Opher Etzion,
Rainer von Ammon:
Event Processing, 6.5. - 11.5.2007
Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007 |
| 113 | EE | K. Mani Chandy,
Michel Charpentier,
Agostino Capponi:
Towards a theory of events.
DEBS 2007: 180-187 |
| 112 | EE | Opher Etzion,
K. Mani Chandy,
Rainer von Ammon:
07191 Abstracts Collection -- Event Processing.
Event Processing 2007 |
| 111 | EE | K. Mani Chandy,
Opher Etzion,
Rainer von Ammon,
Peter Niblett:
07191 Summary -- Event Processing.
Event Processing 2007 |
| 110 | EE | K. Mani Chandy,
Michel Charpentier:
Self-Similar Algorithms for Dynamic Distributed Systems.
ICDCS 2007: 67 |
| 109 | EE | K. Mani Chandy,
Dieter Gawlick:
Event processing using database technology.
SIGMOD Conference 2007: 1169-1170 |
| 2006 |
|---|
| 108 | EE | K. Mani Chandy,
Lu Tian,
Daniel M. Zimmerman:
Enterprise Computing Systems as Information Factories.
EDOC 2006: 427-432 |
| 107 | EE | Lu Tian,
K. Mani Chandy:
Resource Allocation in Streaming Environments.
GRID 2006: 270-277 |
| 106 | EE | Daniel M. Zimmerman,
K. Mani Chandy:
Snapshot Processing in Streaming Environments.
GRID 2006: 319-320 |
| 105 | EE | Opher Etzion,
K. Mani Chandy,
Rainer von Ammon,
Roy Schulte:
Event-Driven Architectures and Complex Event Processing.
IEEE SCC 2006 |
| 104 | EE | Andrey Khorlin,
K. Mani Chandy:
Control-Based Scheduling in a Distributed Stream Processing System.
SCW 2006: 55-64 |
| 2005 |
|---|
| 103 | EE | Daniel M. Zimmerman,
K. Mani Chandy:
A Parallel Algorithm for Correlating Event Streams.
IPDPS 2005 |
| 102 | EE | Elli Albek,
Eric Bax,
Greg Billock,
K. Mani Chandy,
Ian Swett:
An Event Processing Language (EPL) for Building Sense and Respond Applications.
IPDPS 2005 |
| 101 | | K. Mani Chandy:
Sense and Respond Systems.
Int. CMG Conference 2005: 59-66 |
| 2004 |
|---|
| 100 | EE | K. Mani Chandy:
Event Servers for Crisis Management.
HiPC 2004: 3 |
| 99 | EE | Michel Charpentier,
K. Mani Chandy:
Specification transformers: a predicate transformer approach to composition.
Acta Inf. 40(4): 265-301 (2004) |
| 2003 |
|---|
| 98 | | Roman Ginis,
K. Mani Chandy:
Service Composition Issues for Distributed Business Processes.
ICWS 2003: 27-33 |
| 2002 |
|---|
| 97 | | K. Mani Chandy,
Michel Charpentier:
An Experiment in Program Composition and Proof.
Formal Methods in System Design 20(1): 7-21 (2002) |
| 96 | EE | K. Mani Chandy,
Axel Fuchs,
Bill Janssen,
Deepak Mulchandani,
Mark Weiser:
IC Online: Ubiquitous Computing: The Future of Development?
IEEE Distributed Systems Online 3(3): (2002) |
| 2001 |
|---|
| 95 | EE | Mitchell D. Theys,
Shoukat Ali,
Howard Jay Siegel,
K. Mani Chandy,
Kai Hwang,
Ken Kennedy,
Lui Sha,
Kang G. Shin,
Marc Snir,
Larry Snyder,
Thomas L. Sterling:
What Are the Top Ten Most Influential Parallel and Distributed Processing Concepts of the Past Millenium?
J. Parallel Distrib. Comput. 61(12): 1827-1841 (2001) |
| 2000 |
|---|
| 94 | EE | Roman Ginis,
K. Mani Chandy:
Micro-option: a method for optimal selection and atomic reservation of distributed resources in a free market environment.
ACM Conference on Electronic Commerce 2000: 207-214 |
| 93 | EE | Michel Charpentier,
K. Mani Chandy:
Reasoning about Composition Using Property Transformers and Their Conjugates.
IFIP TCS 2000: 580-595 |
| 92 | EE | John Thornley,
K. Mani Chandy:
Monotonic Counters: A New Mechanism for Thread Synchronization.
IPDPS 2000: 573-582 |
| 91 | | Michel Charpentier,
K. Mani Chandy:
Theorems about Composition.
MPC 2000: 167-186 |
| 1999 |
|---|
| 90 | EE | Berna L. Massingill,
K. Mani Chandy:
Parallel Program Archetypes.
IPPS/SPDP 1999: 290-296 |
| 89 | | Michel Charpentier,
K. Mani Chandy:
Examples of Program Composition Illustrating the Use of Universal Properties.
IPPS/SPDP Workshops 1999: 1215-1227 |
| 88 | EE | Michel Charpentier,
K. Mani Chandy:
Towards a Compositional Approach to the Design and Verification of Distributed Systems.
World Congress on Formal Methods 1999: 570-589 |
| 1998 |
|---|
| 87 | | K. Mani Chandy,
Paolo A. G. Sivilotti,
Joseph Kiniry:
A Cottage Industry of Software Publishing: Implications for Theories of Composition.
IPPS/SPDP Workshops 1998: 890-899 |
| 86 | | K. Mani Chandy,
Adam Rifkin,
Eve M. Schooler:
Using announce-listen with global events to develop distributed control systems.
Concurrency - Practice and Experience 10(11-13): 1021-1027 (1998) |
| 85 | | K. Mani Chandy,
Joseph Kiniry,
Adam Rifkin,
Daniel M. Zimmerman:
A Framework for Structured Distributed Object Computing.
Parallel Computing 24(12-13): 1901-1922 (1998) |
| 1997 |
|---|
| 84 | EE | K. Mani Chandy,
Adam Rifkin:
Systematic Composition of Objects in Distributed Internet Applications: Processes and Sessions.
HICSS (1) 1997: 395-404 |
| 83 | | Ravi Ramamoorthi,
Adam Rifkin,
Boris Dimitrov,
K. Mani Chandy:
A General Resource Reservation Framework for Scientific Computing.
ISCOPE 1997: 283-290 |
| 82 | | K. Mani Chandy,
Adam Rifkin:
Systematic Composition of Distributed Objects: Processes and Sessions.
Comput. J. 40(8): 465-478 (1997) |
| 81 | EE | K. Mani Chandy,
Joseph Kiniry,
Adam Rifkin,
Daniel M. Zimmerman:
Webs of Archived Distributed Computations for Asynchronous Collaboration.
The Journal of Supercomputing 11(2): 101-118 (1997) |
| 1996 |
|---|
| 80 | EE | K. Mani Chandy,
Adam Rifkin,
Paolo A. G. Sivilotti,
J. Mandelson,
M. Richardson,
W. Tanaka,
L. Weisman:
A World-Wide Distributed System Using Java and the Internet.
HPDC 1996: 11-18 |
| 79 | EE | K. Mani Chandy,
Eve M. Schooler:
Designing Directories in Distributed Systems: A Systematic Framework.
HPDC 1996: 318- |
| 1995 |
|---|
| 78 | | Maneesh Dhagat,
Rajive Bagrodia,
K. Mani Chandy:
Integrating Task and Data Parallelism in UC.
ICPP (2) 1995: 29-36 |
| 77 | EE | K. Mani Chandy,
Rajit Manohar,
Berna L. Massingill,
Daniel I. Meiron:
Integrating task and data parallelism with the group communication archetype.
IPPS 1995: 724-733 |
| 76 | EE | K. Mani Chandy,
Ian T. Foster:
A Notation for Deterministic Cooperating Processes.
IEEE Trans. Parallel Distrib. Syst. 6(8): 863-871 (1995) |
| 75 | | Ian T. Foster,
K. Mani Chandy:
Fortran M: A Language for Modular Parallel Programming.
J. Parallel Distrib. Comput. 26(1): 24-35 (1995) |
| 74 | | Rajive Bagrodia,
K. Mani Chandy,
Maneesh Dhagat:
UC: A Set-Based Language for Data-Parallel Programming.
J. Parallel Distrib. Comput. 28(2): 186-201 (1995) |
| 73 | | K. Mani Chandy,
Beverly A. Sanders:
Predicate Transformers for Reasoning about Concurrent Computation.
Sci. Comput. Program. 24(2): 129-148 (1995) |
| 1994 |
|---|
| 72 | | K. Mani Chandy:
Properties of Concurrent Programs.
Formal Asp. Comput. 6(6): 607-619 (1994) |
| 1993 |
|---|
| 71 | | K. Mani Chandy:
Writing Correct Parallel Programs.
IPPS 1993: 630-634 |
| 70 | | K. Mani Chandy,
Ian T. Foster:
Parallel Language Constructs for Paradigm Integration and Deterministic Computations.
PARCO 1993: 3-12 |
| 69 | | K. Mani Chandy,
Ian T. Foster:
Deterministic Parallel FORTRAN.
PPSC 1993: 798-805 |
| 68 | | K. Mani Chandy,
Rajive Bagrodia,
Wen-Toh Liao:
Concurrency and Discrete-Event Simulation.
ACM Trans. Model. Comput. Simul. 3(4): 284-285 (1993) |
| 1992 |
|---|
| 67 | | K. Mani Chandy,
Carl Kesselman:
The Derivation of Compositional Programs.
JICSLP 1992: 3-17 |
| 66 | | K. Mani Chandy,
Carl Kesselman:
Compositional C++: Compositional Parallel Programming.
LCPC 1992: 124-144 |
| 1991 |
|---|
| 65 | EE | Rajive Bagrodia,
K. Mani Chandy,
Wen-Toh Liao:
A Unifying Framework for Distributed Simulation.
ACM Trans. Model. Comput. Simul. 1(4): 348-385 (1991) |
| 64 | | K. Mani Chandy,
Carl Kesselman:
Parallel Programming in 2001.
IEEE Software 8(6): 11-20 (1991) |
| 1990 |
|---|
| 63 | EE | Rajive Bagrodia,
K. Mani Chandy,
E. Kwan:
UC: a language for the connection machine.
SC 1990: 525-534 |
| 62 | | K. Mani Chandy:
Reasoning About Continuous Systems.
Sci. Comput. Program. 14(2-3): 117-132 (1990) |
| 1989 |
|---|
| 61 | | K. Mani Chandy:
Mathematics of Program Construction Applied to Analog Neural Networks.
MPC 1989: 21-35 |
| 1988 |
|---|
| 60 | EE | K. Mani Chandy:
Programming parallel computers.
ICCL 1988: 314-321 |
| 59 | EE | Rajive Bagrodia,
K. Mani Chandy:
Programming the Connection Machine.
ICCL 1988: 50-57 |
| 58 | | K. Mani Chandy:
Performance Management of Parallel Computers.
Int. CMG Conference 1988: 1076-1078 |
| 1987 |
|---|
| 57 | | K. Mani Chandy,
Jayadev Misra:
Parallelism and Programming: A Perspective.
FSTTCS 1987: 173-194 |
| 56 | | K. Mani Chandy:
Representing Faulty Distributed Systems as Nondeterministic Sequential Systems.
SRDS 1987: 171-173 |
| 55 | | Rajive Bagrodia,
K. Mani Chandy,
Jayadev Misra:
A Message-Based Approach to Discrete-Event Simulation.
IEEE Trans. Software Eng. 13(6): 654-665 (1987) |
| 1986 |
|---|
| 54 | EE | K. Mani Chandy,
Jayadev Misra:
An Example of Stepwise Refinement of Distributed Programs: Quiescence Detection.
ACM Trans. Program. Lang. Syst. 8(3): 326-343 (1986) |
| 53 | | K. Mani Chandy,
Jayadev Misra:
How Processes Learn.
Distributed Computing 1(1): 40-52 (1986) |
| 52 | | K. Mani Chandy,
Jayadev Misra:
Systolic Algorithms as Programs.
Distributed Computing 1(3): 177-183 (1986) |
| 1985 |
|---|
| 51 | | Rajive Bagrodia,
K. Mani Chandy:
A Micro-Kernel for Distributed Applications.
ICDCS 1985: 140-149 |
| 50 | | Richard L. Gimarc,
K. Mani Chandy:
HSS: A Tool for Evaluating the Performance of Office Systems.
Int. CMG Conference 1985: 30-41 |
| 49 | | K. Mani Chandy:
Concurrent Programming For The Masses (PODC 1984 Invited Address).
PODC 1985: 1-12 |
| 48 | | K. Mani Chandy,
Jayadev Misra:
How Processes Learn.
PODC 1985: 204-214 |
| 47 | EE | K. Mani Chandy,
Leslie Lamport:
Distributed Snapshots: Determining Global States of Distributed Systems
ACM Trans. Comput. Syst. 3(1): 63-75 (1985) |
| 46 | | Ted Herman,
K. Mani Chandy:
On Distributed Search.
Inf. Process. Lett. 21(3): 129-133 (1985) |
| 1984 |
|---|
| 45 | EE | Raymond M. Bryant,
Anthony E. Krzesinski,
M. Seetha Lakshmi,
K. Mani Chandy:
The MVA Priority Approximation
ACM Trans. Comput. Syst. 2(4): 335-359 (1984) |
| 44 | EE | K. Mani Chandy,
Jayadev Misra:
The Drinking Philosopher's Problem.
ACM Trans. Program. Lang. Syst. 6(4): 632-646 (1984) |
| 1983 |
|---|
| 43 | EE | K. Mani Chandy,
Jayadev Misra,
Laura M. Haas:
Distributed Deadlock Detection
ACM Trans. Comput. Syst. 1(2): 144-156 (1983) |
| 42 | EE | K. Mani Chandy,
Alain J. Martin:
A Characterization of Product-Form Queuing Networks
J. ACM 30(2): 286-299 (1983) |
| 1982 |
|---|
| 41 | EE | K. Mani Chandy,
Jayadev Misra,
R. Berry,
Doug Neuse:
The use of performance models in systematic design.
AFIPS National Computer Conference 1982: 251-256 |
| 40 | | K. Mani Chandy,
Jayadev Misra:
A Distributed Algorithm for Detecting Resource Deadlocks in Distributed Systems.
PODC 1982: 157-164 |
| 39 | | Jayadev Misra,
K. Mani Chandy,
Todd Smith:
Proving Safety and Liveness of Communicating Processes with Examples.
PODC 1982: 201-208 |
| 38 | EE | Jayadev Misra,
K. Mani Chandy:
Termination Detection of Diffusing Computations in Communicating Sequential Processes.
ACM Trans. Program. Lang. Syst. 4(1): 37-43 (1982) |
| 37 | EE | Jayadev Misra,
K. Mani Chandy:
A Distributed Graph Algorithm: Knot Detection.
ACM Trans. Program. Lang. Syst. 4(4): 678-686 (1982) |
| 36 | | K. Mani Chandy,
Jayadev Misra:
Distributed Computation on Graphs: Shortest Path Algorithms.
Commun. ACM 25(11): 833-837 (1982) |
| 35 | | K. Mani Chandy,
Doug Neuse:
Linearzer: A Heuristic Algorithm for Queueing Network Models of Computing Systems.
Commun. ACM 25(2): 126-134 (1982) |
| 34 | | Doug Neuse,
K. Mani Chandy:
HAM: The Heuristic Aggregation Method.
SIGMETRICS Performance Evaluation Review 11(4): 195-212 (1982) |
| 1981 |
|---|
| 33 | | Doug Neuse,
K. Mani Chandy,
Jayadev Misra,
R. Berry:
A Computer Modeling System Based on a User-Extensible Modeling Library.
Int. CMG Conference 1981: 127-129 |
| 32 | | Doug Neuse,
K. Mani Chandy:
SCAT: A Heuristic Algorithm for Queueing Network Models of Computing Systems.
SIGMETRICS 1981: 59-79 |
| 31 | | K. Mani Chandy,
Jayadev Misra:
Asynchronous Distributed Simulation via a Sequence of Parallel Computations.
Commun. ACM 24(4): 198-206 (1981) |
| 30 | | Jayadev Misra,
K. Mani Chandy:
Proofs of Networks of Processes.
IEEE Trans. Software Eng. 7(4): 417-426 (1981) |
| 1980 |
|---|
| 29 | | K. Mani Chandy,
Charles H. Sauer:
Computational Algorithms for Product Form Queueing Networks.
Commun. ACM 23(10): 573-583 (1980) |
| 1979 |
|---|
| 28 | | Tilak Agerwala,
K. Mani Chandy,
D. E. Lang:
A Modeling Approach and Design Tool for Pipelined Central Processors.
ISCA 1979: 122-129 |
| 27 | | Charles H. Sauer,
K. Mani Chandy:
The Impact of Distributions and Disciplines on Multiple Processor Systems.
Commun. ACM 22(1): 25-34 (1979) |
| 26 | | K. Mani Chandy,
Victor Holmes,
Jayadev Misra:
Distributed Simulation of Networks.
Computer Networks 3: 105-113 (1979) |
| 25 | | Randolph T. Yeh,
K. Mani Chandy:
On the Design of Elementary Distributed Systems.
Computer Networks 3: 24-35 (1979) |
| 24 | | K. Mani Chandy,
Jayadev Misra:
Distributed Simulation: A Case Study in Design and Verification of Distributed Programs.
IEEE Trans. Software Eng. 5(5): 440-452 (1979) |
| 23 | | K. Mani Chandy,
Jayadev Misra:
Deadlock Absence Proofs for Networks of Communicating Processes.
Inf. Process. Lett. 9(4): 185-189 (1979) |
| 1978 |
|---|
| 22 | | Randolph T. Yeh,
K. Mani Chandy:
On the Design of Elementary Distributed Systems.
Berkeley Workshop 1978: 289-321 |
| 21 | | K. Mani Chandy,
Charles H. Sauer:
Approximate Methods for Analyzing Queueing Network Models of Computing Systems.
ACM Comput. Surv. 10(3): 281-317 (1978) |
| 20 | | Donald F. Towsley,
K. Mani Chandy,
James C. Browne:
Models for Parallel Processing Within Programs: Application to CPU: I/O and I/O: I/O Overlap.
Commun. ACM 21(10): 821-831 (1978) |
| 1977 |
|---|
| 19 | | Lawrence Van Sickle,
K. Mani Chandy:
Computational Complexity of Network Design Algorithms.
IFIP Congress 1977: 235-239 |
| 18 | EE | K. Mani Chandy:
Models of Distributed Systems.
VLDB 1977: 105-120 |
| 17 | | R. M. Brown,
James C. Browne,
K. Mani Chandy:
Memory Management and Response Time.
Commun. ACM 20(3): 153-165 (1977) |
| 16 | | K. Mani Chandy,
J. Hogarth,
Charles H. Sauer:
Selecting Capacities in Computer Communication Systems.
IEEE Trans. Software Eng. 3(4): 290-295 (1977) |
| 15 | EE | K. Mani Chandy,
John H. Howard Jr.,
Donald F. Towsley:
Product Form and Local Balance in Queueing Networks.
J. ACM 24(2): 250-263 (1977) |
| 1976 |
|---|
| 14 | | K. Mani Chandy:
Bayesian Models of Design Based on Intuition.
ICSE 1976: 281-285 |
| 13 | | K. Mani Chandy,
John H. Howard Jr.,
Donald F. Towsley:
Product Form and Local Balance in Queueing Networks.
Performance 1976: 89-101 |
| 1975 |
|---|
| 12 | | K. Mani Chandy,
P. F. Reynolds:
Scheduling Partially Ordered Tasks with Probabilistic Execution Times.
SOSP 1975: 169-177 |
| 11 | | K. Mani Chandy,
Ulrich Herzog,
Lin S. Woo:
Parametric Analysis of Queuing Networks.
IBM Journal of Research and Development 19(1): 36-42 (1975) |
| 10 | | K. Mani Chandy,
Ulrich Herzog,
Lin S. Woo:
Approximate Analysis of General Queuing Networks.
IBM Journal of Research and Development 19(1): 43-49 (1975) |
| 9 | | Ulrich Herzog,
Lin S. Woo,
K. Mani Chandy:
Solution of Queuing Problems by a Recursive Technique.
IBM Journal of Research and Development 19(3): 295-300 (1975) |
| 8 | | Charles H. Sauer,
K. Mani Chandy:
Approximate Analysis of Central Server Models.
IBM Journal of Research and Development 19(3): 301-313 (1975) |
| 7 | | K. Mani Chandy,
James C. Browne,
Charles W. Dissly,
Werner R. Uhrig:
Analytic Models for Rollback and Recovery Strategies in Data Base Systems.
IEEE Trans. Software Eng. 1(1): 100-110 (1975) |
| 6 | EE | Forest Baskett,
K. Mani Chandy,
Richard R. Muntz,
Fernando G. Palacios:
Open, Closed, and Mixed Networks of Queues with Different Classes of Customers.
J. ACM 22(2): 248-260 (1975) |
| 1974 |
|---|
| 5 | | P. F. Reynolds,
K. Mani Chandy:
A Recognizer and Post-Recognizer for Optimizing Execution Times of Programs.
Sagamore Computer Conference 1974: 203-204 |
| 4 | | Tom W. Keller,
K. Mani Chandy:
Computer Models with Constrained Parallel Processors.
Sagamore Computer Conference 1974: 207-208 |
| 3 | | Thomas L. Adam,
K. Mani Chandy,
J. R. Dickson:
A Comparison of List Schedules for Parallel Processing Systems.
Commun. ACM 17(12): 685-690 (1974) |
| 1970 |
|---|
| 2 | EE | C. V. Ramamoorthy,
K. Mani Chandy:
Optimization of Memory Hierarchies in Multiprogrammed Systems.
J. ACM 17(3): 426-445 (1970) |
| 1968 |
|---|
| 1 | | K. Mani Chandy,
C. V. Ramamoorthy:
Optimization of Information Storage Systems
Information and Control 13(6): 509-526 (1968) |
