The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ethan D. Bolker: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Subhash C. Agrawal, Ethan D. Bolker, Jeffrey P. Buzen, Tim Grieser, J. Munoz
    On Tuning the Fair Share Scheduler in VM Operating Systems. [Citation Graph (0, 0)][DBLP]
    Int. CMG Conference, 1984, pp:168-174 [Conf]
  2. Ethan D. Bolker
    Measuring and Modeling MVS Under VM. [Citation Graph (0, 0)][DBLP]
    Int. CMG Conference, 1985, pp:710-713 [Conf]
  3. Ethan D. Bolker
    A Capacity Planning/Queueing Theory Primer or How Far Can You Go on the Back/Of/An/Envelope? [Citation Graph (0, 0)][DBLP]
    Int. CMG Conference, 1987, pp:734-735 [Conf]
  4. Ethan D. Bolker, Yiping Ding
    On the Performance Impact of Fair Share Scheduling. [Citation Graph (0, 0)][DBLP]
    Int. CMG Conference, 2000, pp:71-82 [Conf]
  5. Ethan D. Bolker, Yiping Ding, Ken Hu
    Virtual Performance Won't Do: Capacity Planning for Virtual Systems. [Citation Graph (0, 0)][DBLP]
    Int. CMG Conference, 2005, pp:39-50 [Conf]
  6. Ethan D. Bolker, Yiping Ding, Anatoliy Rikun
    Fair Share Modeling for Large Systems: Aggregation, Hierarchical Decomposition and Randomization. [Citation Graph (0, 0)][DBLP]
    Int. CMG Conference, 2001, pp:807-818 [Conf]
  7. Ethan D. Bolker, Annie W. Shum, Subhash C. Agrawal
    Modeling Memory. [Citation Graph (0, 0)][DBLP]
    Int. CMG Conference, 1986, pp:733-737 [Conf]
  8. Yiping Ding, Ethan D. Bolker, Arjun Kumar
    Performance Implications of Hyper-Threading. [Citation Graph (0, 0)][DBLP]
    Int. CMG Conference, 2003, pp:21-29 [Conf]
  9. Yiping Ding, Ethan D. Bolker, Yefim Somin
    Interpreting NT Queue Length Measurements. [Citation Graph (0, 0)][DBLP]
    Int. CMG Conference, 2002, pp:759-770 [Conf]
  10. Ethan D. Bolker, Andrew M. Gleason
    Counting Permutations. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1980, v:29, n:2, pp:236-242 [Journal]
  11. Ethan D. Bolker, Thomas Zaslavsky
    A simple algorithm that proves half-integrality of bidirected network programming. [Citation Graph (0, 0)][DBLP]
    Networks, 2006, v:48, n:1, pp:36-38 [Journal]

Search in 0.001secs, Finished in 0.002secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002