default search action
John L. Bruno
Person information
- affiliation: University of California, Davis, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2002
- [j21]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)
1990 – 1999
- 1999
- [j20]John L. Bruno, Edward G. Coffman Jr., Jeffrey C. Lagarias, Tom J. Richardson, Peter W. Shor:
Processor Shadowing: Maximizing Expected Throughput in Fault-Tolerant Systems. Math. Oper. Res. 24(2): 362-382 (1999) - [c20]Eran Gabber, Christopher Small, John L. Bruno, José Carlos Brustoloni, Avi Silberschatz:
Pebble: A Component-based Operating System for Embedded Applications. USENIX Workshop on Embedded Systems 1999 - [c19]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 - [c18]Murat Karaorman, Urs Hölzle, John L. Bruno:
jContractor: A Reflective Java Library to Support Design by Contract. Reflection 1999: 175-196 - [c17]Phillip B. Gibbons, John L. Bruno, Steven Phillips:
Post-Mortem Black-Box Correctness Tests for Basic Parallel Data Structures. SPAA 1999: 44-53 - [c16]John L. Bruno, José Carlos Brustoloni, Eran Gabber, Banu Özden, Abraham Silberschatz:
Retrofitting Quality of Service into a Time-Sharing Operating System. USENIX ATC, General Track 1999: 15-26 - [c15]Eran Gabber, Christopher Small, John L. Bruno, José Carlos Brustoloni, Abraham Silberschatz:
The Pebble Component-Based Operating System. USENIX ATC, General Track 1999: 267-282 - 1998
- [c14]John L. Bruno, Eran Gabber, Banu Özden, Avi Silberschatz:
The Eclipse Operating System: Providing Quality of Service via Reservation Domains. USENIX ATC 1998 - 1997
- [j19]John L. Bruno, Edward G. Coffman Jr.:
Optimal Fault-Tolerant Computing on Multiprocessor Systems. Acta Informatica 34(12): 881-904 (1997) - [j18]Vasudha 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) - [c13]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
- [c12]John L. Bruno, Phillip B. Gibbons, Steven Phillips:
Testing Concurrent Data Structures (Abstract). PODC 1996: 124 - 1995
- [j17]Vasudha Krishnaswamy, John L. Bruno:
On the Complexity of Concurrency Control Using Semantic Information. Acta Informatica 32(3): 271-284 (1995) - [c11]Divyakant Agrawal, John L. Bruno, Amr El Abbadi, Vasudha Krishnaswamy:
Managing Concurrent Activities in Collaborative Environments. CoopIS 1995: 112-124 - 1994
- [c10]Divyakant Agrawal, John L. Bruno, Amr El Abbadi, Vasudha Krishnaswamy:
Relative Serializbility: An Approach for Relaxing the Atomicity of Transactions. PODS 1994: 139-149 - 1993
- [j16]Murat Karaorman, John L. Bruno:
Introducing Concurrency to a Sequential Language. Commun. ACM 36(9): 103-116 (1993) - 1992
- [c9]Murat Karaorman, John L. Bruno:
A concurrency Mechanism for Sequential Eiffel. TOOLS (8) 1992: 63-77
1980 – 1989
- 1989
- [j15]Igal Adiri, John L. Bruno, Esther Frostig, A. H. G. Rinnooy Kan:
Single Machine Flow-Time Scheduling With a Single Breakdown. Acta Informatica 26(7): 679-696 (1989) - 1988
- [c8]John L. Bruno, Peter R. Cappello:
Implementing the beam and warming method on the hypercube. C³P 1988: 1073-1087 - 1986
- [j14]John L. Bruno, Peter J. Downey:
Probabilistic Bounds on the Performance of List Scheduling. SIAM J. Comput. 15(2): 409-417 (1986) - 1985
- [j13]John L. Bruno:
On Scheduling Tasks with Exponential Service Times and In-Tree Precedence Constraints. Acta Informatica 22(2): 139-148 (1985) - [j12]John L. Bruno, Peter J. Downey:
Probabilistic Bounds for Dual Bin-Packing. Acta Informatica 22(3): 333-345 (1985) - 1981
- [j11]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
- [j10]John L. Bruno, John W. Jones III, Kimming So:
Deterministic Scheduling with Pipelined Processors. IEEE Trans. Computers 29(4): 308-316 (1980)
1970 – 1979
- 1978
- [j9]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
- [j8]John L. Bruno, Ravi Sethi:
Code Generation for a One-Register Machine. J. ACM 23(3): 502-510 (1976) - [j7]John L. Bruno:
Sequencing Jobs with Stochastic Task Structures on a Single Machine. J. ACM 23(4): 655-664 (1976) - [j6]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
- [j5]John L. Bruno, T. Lassagne:
The Generation of Optimal Code for Stack Machines. J. ACM 22(3): 382-396 (1975) - [j4]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
- [j3]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
- [j2]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 1972: 71-77 - 1971
- [j1]John L. Bruno, Stanley M. Altman:
A Theory of Asynchronous Control Networks. IEEE Trans. Computers 20(6): 629-638 (1971) - [c2]John L. Bruno, Edward G. Coffman Jr.:
Nearly Optimal Binary Search Trees. IFIP Congress (1) 1971: 99-103
1960 – 1969
- 1969
- [c1]John L. Bruno, Stanley M. Altman:
Asynchronous Control Networks. SWAT 1969: 61-73
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-17 20:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: