John L. Bruno

According to our database1, John L. Bruno
  • authored at least 40 papers between 1969 and 2002.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2002
Black-Box Correctness Tests for Basic Parallel Data Structures.
Theory Comput. Syst., 2002

1999
Processor Shadowing: Maximizing Expected Throughput in Fault-Tolerant Systems.
Math. Oper. Res., 1999

The Pebble Component-Based Operating System.
Proceedings of the 1999 USENIX Annual Technical Conference, 1999

Retrofitting Quality of Service into a Time-Sharing Operating System.
Proceedings of the 1999 USENIX Annual Technical Conference, 1999

Post-Mortem Black-Box Correctness Tests for Basic Parallel Data Structures.
SPAA, 1999

jContractor: A Reflective Java Library to Support Design by Contract.
Proceedings of the Meta-Level Architectures and Reflection, 1999

Disk Scheduling with Quality of Service Guarantees.
Proceedings of the IEEE International Conference on Multimedia Computing and Systems, 1999

Pebble: A Component-based Operating System for Embedded Applications.
Proceedings of the USENIX Workshop on Embedded Systems 1999, 1999

1998
The Eclipse Operating System: Providing Quality of Service via Reservation Domains.
Proceedings of the 1998 USENIX Annual Technical Conference, 1998

1997
Relative Serializability: An Approach for Relaxing the Atomicity of Transactions.
J. Comput. Syst. Sci., 1997

Optimal Fault-Tolerant Computing on Multiprocessor Systems.
Acta Inf., 1997

Move-to-Rear List Scheduling: A New Scheduling Algorithm for Providing QoS Guarantees.
Proceedings of the Fifth ACM International Conference on Multimedia '97, 1997

1996
Testing Concurrent Data Structures (Abstract).
Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

1995
On the Complexity of Concurrency Control Using Semantic Information.
Acta Inf., 1995

Managing Concurrent Activities in Collaborative Environments.
CoopIS, 1995

1994
Relative Serializbility: An Approach for Relaxing the Atomicity of Transactions.
Proceedings of the Thirteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1994

1993
Introducing Concurrency to a Sequential Language.
Commun. ACM, 1993

1992
A concurrency Mechanism for Sequential Eiffel.
Proceedings of the TOOLS 1992: 8th International Conference on Technology of Object-Oriented Languages and Systems, 1992

1989
Single Machine Flow-Time Scheduling With a Single Breakdown.
Acta Inf., 1989

1986
Probabilistic Bounds on the Performance of List Scheduling.
SIAM J. Comput., 1986

1985
Probabilistic Bounds for Dual Bin-Packing.
Acta Inf., 1985

On Scheduling Tasks with Exponential Service Times and In-Tree Precedence Constraints.
Acta Inf., 1985

1981
Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or Makespan.
J. ACM, 1981

Performance Analysis of a Distributed File Cache.
Berkeley Workshop, 1981

1980
Deterministic Scheduling with Pipelined Processors.
IEEE Trans. Computers, 1980

1978
Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs.
SIAM J. Comput., 1978

1976
On Batch Scheduling of Jobs with Stochastic Service Times and Cost Structures on a Single Server.
J. Comput. Syst. Sci., 1976

Code Generation for a One-Register Machine.
J. ACM, 1976

Sequencing Jobs with Stochastic Task Structures on a Single Machine.
J. ACM, 1976

Task Sequencing in a Batch Environment with Setup Times.
Proceedings of the Modelling and Performance Evaluation of Computer Systems, 1976

1975
On Scheduling Chains of Jobs on One Processor with Limited Preemption.
SIAM J. Comput., 1975

The Generation of Optimal Code for Stack Machines.
J. ACM, 1975

1974
Scheduling Independent Tasks to Reduce Mean Finishing Time.
Commun. ACM, 1974

Algorithms for Minimizing Mean Flow Time.
IFIP Congress, 1974

1973
Scheduling Independent Tasks to Reduce Mean Finishing Time (Extended Abstract).
Proceedings of the Fourth Symposium on Operating System Principles, 1973

1972
The Expression of Algorithms by Charts.
J. ACM, 1972

Consistency of Synchronization Nets using P and V Operations
Proceedings of the 13th Annual Symposium on Switching and Automata Theory, 1972

1971
A Theory of Asynchronous Control Networks.
IEEE Trans. Computers, 1971

Nearly Optimal Binary Search Trees.
IFIP Congress (1), 1971

1969
Asynchronous Control Networks
Proceedings of the 10th Annual Symposium on Switching and Automata Theory, 1969


  Loading...