- CSB - MetaPress - Google - Bing - Yahoo
 | 2002 | |
|---|---|---|
| j19 |      | Phillip B. Gibbons, John L. Bruno, Steven Phillips: Black-Box Correctness Tests for Basic Parallel Data Structures. Theory Comput. Syst. 35(4): 391-432 (2002) |
| 1999 | ||
| c17 | | John L. Bruno, José Carlos Brustoloni, Eran Gabber, Banu Özden, Abraham Silberschatz: Disk Scheduling with Quality of Service Guarantees. ICMCS, Vol. 2 1999: 400-405 |
| c16 | | Murat Karaorman, Urs Hölzle, John L. Bruno: jContractor: A Reflective Java Library to Support Design by Contract. Reflection 1999: 175-196 |
| c15 | | Phillip B. Gibbons, John L. Bruno, Steven Phillips: Post-Mortem Black-Box Correctness Tests for Basic Parallel Data Structures. SPAA 1999: 44-53 |
| c14 | | John L. Bruno, José Carlos Brustoloni, Eran Gabber, Banu Özden, Abraham Silberschatz: Retrofitting Quality of Service into a Time-Sharing Operating System. USENIX Annual Technical Conference, General Track 1999: 15-26 |
| c13 | | Eran Gabber, Christopher Small, John L. Bruno, José Carlos Brustoloni, Abraham Silberschatz: The Pebble Component-Based Operating System. USENIX Annual Technical Conference, General Track 1999: 267-282 |
| 1997 | ||
| j18 | | John L. Bruno, Edward G. Coffman Jr.: Optimal Fault-Tolerant Computing on Multiprocessor Systems. Acta Inf. 34(12): 881-904 (1997) |
| j17 | | Vashudha Krishnaswamy, Divyakant Agrawal, John L. Bruno, Amr El Abbadi: Relative Serializability: An Approach for Relaxing the Atomicity of Transactions. J. Comput. Syst. Sci. 55(2): 344-354 (1997) |
| c12 | | John L. Bruno, Eran Gabber, Banu Özden, Abraham Silberschatz: Move-to-Rear List Scheduling: A New Scheduling Algorithm for Providing QoS Guarantees. ACM Multimedia 1997: 63-73 |
| 1996 | ||
| c11 | | John L. Bruno, Phillip B. Gibbons, Steven Phillips: Testing Concurrent Data Structures (Abstract). PODC 1996: 124 |
| 1995 | ||
| j16 | | Vashudha Krishnaswamy, John L. Bruno: On the Complexity of Concurrency Control Using Semantic Information. Acta Inf. 32(3): 271-284 (1995) |
| c10 |  | Divyakant Agrawal, John L. Bruno, Amr El Abbadi, Vashudha Krishnaswamy: Managing Concurrent Activities in Collaborative Environments. CoopIS 1995: 112-124 |
| 1994 | ||
| c9 | | Divyakant Agrawal, John L. Bruno, Amr El Abbadi, Vashudha Krishnaswamy: Relative Serializbility: An Approach for Relaxing the Atomicity of Transactions. PODS 1994: 139-149 |
| 1993 | ||
| j15 | | Murat Karaorman, John L. Bruno: Introducing Concurrency to a Sequential Language. Commun. ACM 36(9): 103-116 (1993) |
| 1992 | ||
| c8 | | Murat Karaorman, John L. Bruno: A concurrency Mechanism for Sequential Eiffel. TOOLS (8) 1992: 63-77 |
| 1989 | ||
| j14 | | Igal Adiri, John L. Bruno, Esther Frostig, A. H. G. Rinnooy Kan: Single Machine Flow-Time Scheduling With a Single Breakdown. Acta Inf. 26(7): 679-696 (1989) |
| 1986 | ||
| j13 | | John L. Bruno, Peter J. Downey: Probabilistic Bounds on the Performance of List Scheduling. SIAM J. Comput. 15(2): 409-417 (1986) |
| 1985 | ||
| j12 | | John L. Bruno: On Scheduling Tasks with Exponential Service Times and In-Tree Precedence Constraints. Acta Inf. 22(2): 139-148 (1985) |
| j11 | | John L. Bruno, Peter J. Downey: Probabilistic Bounds for Dual Bin-Packing. Acta Inf. 22(3): 333-345 (1985) |
| 1981 | ||
| j10 | | John L. Bruno, Peter J. Downey, Greg N. Frederickson: Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or Makespan. J. ACM 28(1): 100-113 (1981) |
| c7 | | Gautam Barua, John L. Bruno, Peter J. Downey: Performance Analysis of a Distributed File Cache. Berkeley Workshop 1981: 240 |
| 1980 | ||
| j9 | | John L. Bruno, John W. Jones III, Kimming So: Deterministic Scheduling with Pipelined Processors. IEEE Trans. Computers 29(4): 308-316 (1980) |
| 1978 | ||
| j8 | | John L. Bruno, Peter J. Downey: Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs. SIAM J. Comput. 7(4): 393-404 (1978) |
| 1976 | ||
| j7 | | |
| j6 | | John L. Bruno: Sequencing Jobs with Stochastic Task Structures on a Single Machine. J. ACM 23(4): 655-664 (1976) |
| j5 | | John L. Bruno, Edward G. Coffman Jr., D. B. Johnson: On Batch Scheduling of Jobs with Stochastic Service Times and Cost Structures on a Single Server. J. Comput. Syst. Sci. 12(3): 319-335 (1976) |
| c6 | | John L. Bruno, Ravi Sethi: Task Sequencing in a Batch Environment with Setup Times. Performance 1976: 81-88 |
| 1975 | ||
| j4 | | John L. Bruno, T. Lassagne: The Generation of Optimal Code for Stack Machines. J. ACM 22(3): 382-396 (1975) |
| j3 | | John L. Bruno, Micha Hofri: On Scheduling Chains of Jobs on One Processor with Limited Preemption. SIAM J. Comput. 4(4): 478-490 (1975) |
| 1974 | ||
| j2 | | John L. Bruno, Edward G. Coffman Jr., Ravi Sethi: Scheduling Independent Tasks to Reduce Mean Finishing Time. Commun. ACM 17(7): 382-387 (1974) |
| c5 | | John L. Bruno, Edward G. Coffman Jr., Ravi Sethi: Algorithms for Minimizing Mean Flow Time. IFIP Congress 1974: 504-510 |
| 1973 | ||
| c4 | | John L. Bruno, Edward G. Coffman Jr., Ravi Sethi: Scheduling Independent Tasks to Reduce Mean Finishing Time (Extended Abstract). SOSP 1973: 102-103 |
| 1972 | ||
| j1 | | John L. Bruno, Kenneth Steiglitz: The Expression of Algorithms by Charts. J. ACM 19(3): 517-525 (1972) |
| c3 | | John L. Bruno, Edward G. Coffman Jr., W. H. Hosken: Consistency of Synchronization Nets using P and V Operations. SWAT (FOCS) 1972: 71-77 |
| 1971 | ||
| c2 | | John L. Bruno, Edward G. Coffman Jr.: Nearly Optimal Binary Search Trees. IFIP Congress (1) 1971: 99-103 |
| 1969 | ||
| c1 | | |
Colors in the list of coauthors
Last update Sun May 19 12:25:35 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page