John L. Bruno - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 41 from 41

2002

Black-Box Correctness Tests for Basic Parallel Data StructuresPhillip B. Gibbons, John L. Bruno, Steven Phillips. mst, 35(4):391-432, 2002. [doi]

1999

Retrofitting Quality of Service into a Time-Sharing Operating SystemJohn L. Bruno, José Carlos Brustoloni, Eran Gabber, Banu Özden, Abraham Silberschatz. usenix 1999: 15-26 [doi]

Disk Scheduling with Quality of Service GuaranteesJohn L. Bruno, José Carlos Brustoloni, Eran Gabber, Banu Özden, Abraham Silberschatz. icmcs 1999: 400-405 [doi]

Processor Shadowing: Maximizing Expected Throughput in Fault-Tolerant SystemsJohn L. Bruno, Edward G. Coffman J., Jeffrey C. Lagarias, Tom J. Richardson, Peter W. Shor. mor, 24(2):362-382, 1999. [doi]

Pebble: A Component-based Operating System for Embedded ApplicationsEran Gabber, Christopher Small, John L. Bruno, José Carlos Brustoloni, Avi Silberschatz. embsys 1999: [doi]

The Pebble Component-Based Operating SystemEran Gabber, Christopher Small, John L. Bruno, José Carlos Brustoloni, Abraham Silberschatz. usenix 1999: 267-282 [doi]

Post-Mortem Black-Box Correctness Tests for Basic Parallel Data StructuresPhillip B. Gibbons, John L. Bruno, Steven Phillips. spaa 1999: 44-53 [doi]

jContractor: A Reflective Java Library to Support Design by ContractMurat Karaorman, Urs Hölzle, John L. Bruno. reflection 1999: 175-196 [doi]

1998

The Eclipse Operating System: Providing Quality of Service via Reservation DomainsJohn L. Bruno, Eran Gabber, Banu Özden, Avi Silberschatz. usenix 1998: [doi]

1997

Optimal Fault-Tolerant Computing on Multiprocessor SystemsJohn L. Bruno, Edward G. Coffman Jr.. ACTA, 34(12):881-904, 1997. [doi]

Move-to-Rear List Scheduling: A New Scheduling Algorithm for Providing QoS GuaranteesJohn L. Bruno, Eran Gabber, Banu Özden, Abraham Silberschatz. mm 1997: 63-73 [doi]

Relative Serializability: An Approach for Relaxing the Atomicity of TransactionsVashudha Krishnaswamy, Divyakant Agrawal, John L. Bruno, Amr El Abbadi. jcss, 55(2):344-354, 1997.

1996

Testing Concurrent Data Structures (Abstract)John L. Bruno, Phillip B. Gibbons, Steven Phillips. podc 1996: 124

1995

Managing Concurrent Activities in Collaborative EnvironmentsDivyakant Agrawal, John L. Bruno, Amr El Abbadi, Vashudha Krishnaswamy. coopis 1995: 112-124

On the Complexity of Concurrency Control Using Semantic InformationVashudha Krishnaswamy, John L. Bruno. ACTA, 32(3):271-284, 1995.

1994

Relative Serializbility: An Approach for Relaxing the Atomicity of TransactionsDivyakant Agrawal, John L. Bruno, Amr El Abbadi, Vashudha Krishnaswamy. PODS 1994: 139-149 [doi]

1993

Introducing Concurrency to a Sequential LanguageMurat Karaorman, John L. Bruno. CACM, 36(9):103-116, 1993.

1992

A concurrency Mechanism for Sequential EiffelMurat Karaorman, John L. Bruno. TOOLS 1992: 63-77

1989

Single Machine Flow-Time Scheduling With a Single BreakdownIgal Adiri, John L. Bruno, Esther Frostig, A. H. G. Rinnooy Kan. ACTA, 26(7):679-696, 1989.

1988

Implementing the beam and warming method on the hypercubeJohn L. Bruno, Peter R. Cappello. c3p 1988: 1073-1087 [doi]

1986

Probabilistic Bounds on the Performance of List SchedulingJohn L. Bruno, Peter J. Downey. SICOMP, 15(2):409-417, 1986.

1985

On Scheduling Tasks with Exponential Service Times and In-Tree Precedence ConstraintsJohn L. Bruno. ACTA, 22(2):139-148, 1985.

Probabilistic Bounds for Dual Bin-PackingJohn L. Bruno, Peter J. Downey. ACTA, 22(3):333-345, 1985.

1981

Performance Analysis of a Distributed File CacheGautam Barua, John L. Bruno, Peter J. Downey. berkeley 1981: 240

Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or MakespanJohn L. Bruno, Peter J. Downey, Greg N. Frederickson. JACM, 28(1):100-113, 1981. [doi]

1980

Deterministic Scheduling with Pipelined ProcessorsJohn L. Bruno, John W. Jones III, Kimming So. TC, 29(4):308-316, 1980.

1978

Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover CostsJohn L. Bruno, Peter J. Downey. SICOMP, 7(4):393-404, 1978.

1976

On Batch Scheduling of Jobs with Stochastic Service Times and Cost Structures on a Single ServerJohn L. Bruno, Edward G. Coffman Jr., D. B. Johnson. jcss, 12(3):319-335, 1976.

Sequencing Jobs with Stochastic Task Structures on a Single MachineJohn L. Bruno. JACM, 23(4):655-664, 1976. [doi]

Task Sequencing in a Batch Environment with Setup TimesJohn L. Bruno, Ravi Sethi. performance 1977: 81-88

Code Generation for a One-Register MachineJohn L. Bruno, Ravi Sethi. JACM, 23(3):502-510, 1976. [doi]

1975

On Scheduling Chains of Jobs on One Processor with Limited PreemptionJohn L. Bruno, Micha Hofri. SICOMP, 4(4):478-490, 1975.

The Generation of Optimal Code for Stack MachinesJohn L. Bruno, T. Lassagne. JACM, 22(3):382-396, 1975. [doi]

1974

Algorithms for Minimizing Mean Flow TimeJohn L. Bruno, Edward G. Coffman Jr., Ravi Sethi. ifip 1974: 504-510

Scheduling Independent Tasks to Reduce Mean Finishing TimeJohn L. Bruno, Edward G. Coffman Jr., Ravi Sethi. CACM, 17(7):382-387, 1974.

1973

Scheduling Independent Tasks to Reduce Mean Finishing Time (Extended Abstract)John L. Bruno, Edward G. Coffman Jr., Ravi Sethi. sosp 1973: 102-103

1972

Consistency of Synchronization Nets using P and V OperationsJohn L. Bruno, Edward G. Coffman Jr., W. H. Hosken. focs 1972: 71-77

The Expression of Algorithms by ChartsJohn L. Bruno, Kenneth Steiglitz. JACM, 19(3):517-525, 1972. [doi]

1971

Nearly Optimal Binary Search TreesJohn L. Bruno, Edward G. Coffman Jr.. ifip 1971: 99-103

A Theory of Asynchronous Control NetworksJohn L. Bruno, Stanley M. Altman. TC, 20(6):629-638, 1971. [doi]

1969

Asynchronous Control NetworksJohn L. Bruno, S. M. Altman. focs 1969: 61-73

Sign in or sign up to see more results.

runs on WebDSL