The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

David P. Bunde: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Vitus J. Leung, Esther M. Arkin, Michael A. Bender, David P. Bunde, Jeanette Johnston, Alok Lal, Joseph S. B. Mitchell, Cynthia A. Phillips, Steven S. Seiden
    Processor Allocation on Cplant: Achieving General Processor Locality Using One-Dimensional Allocation Strategies. [Citation Graph (0, 0)][DBLP]
    CLUSTER, 2002, pp:296-304 [Conf]
  2. David P. Bunde, Vitus J. Leung, Jens Mache
    Communication Patterns and Allocation Strategies. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2004, pp:- [Conf]
  3. David P. Bunde
    Power-aware scheduling for makespan and flow. [Citation Graph (0, 0)][DBLP]
    SPAA, 2006, pp:190-196 [Conf]
  4. David P. Bunde, Yishay Mansour
    Improved combination of online algorithms for acceptance and rejection. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:265-266 [Conf]
  5. Michael A. Bender, David P. Bunde, Erik D. Demaine, Sándor P. Fekete, Vitus J. Leung, Henk Meijer, Cynthia A. Phillips
    Communication-Aware Processor Allocation for Supercomputers. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:169-181 [Conf]
  6. Michael A. Bender, David P. Bunde, Erik D. Demaine, Sándor P. Fekete, Vitus J. Leung, Henk Meijer, Cynthia A. Phillips
    Communication-Aware Processor Allocation for Supercomputers [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  7. David P. Bunde
    SPT is optimally competitive for uniprocessor flow. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:90, n:5, pp:233-238 [Journal]
  8. David P. Bunde
    Power-aware scheduling for makespan and flow [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]

  9. Scheduling Restartable Jobs with Short Test Runs. [Citation Graph (, )][DBLP]


  10. Average Rate Speed Scaling. [Citation Graph (, )][DBLP]


  11. Dispatching Equal-Length Jobs to Parallel Machines to Maximize Throughput. [Citation Graph (, )][DBLP]


  12. Communication-Aware Processor Allocation for Supercomputers: Finding Point Sets of Small Average Distance. [Citation Graph (, )][DBLP]


  13. Optimal strong parity edge-coloring of complete graphs. [Citation Graph (, )][DBLP]


  14. Distance-2 Edge Coloring is NP-Complete [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
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