The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Uwe Schwiegelshohn: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Edwin Naroska, Rung-Ji Shang, Feipei Lai, Uwe Schwiegelshohn
    Hybrid Parallel Circuit Simulation Approaches. [Citation Graph (0, 0)][DBLP]
    IEEE PACT, 2000, pp:261-270 [Conf]
  2. Carsten Ernemann, Volker Hamscher, Uwe Schwiegelshohn, Ramin Yahyapour, Achim Streit
    On Advantages of Grid Computing for Parallel Job Scheduling. [Citation Graph (0, 0)][DBLP]
    CCGRID, 2002, pp:39-0 [Conf]
  3. Franco Gasperoni, Uwe Schwiegelshohn
    Scheduling Loops on Parallel Processors: A Simple Algorithm with Close to Optimum Performance. [Citation Graph (0, 0)][DBLP]
    CONPAR, 1992, pp:625-636 [Conf]
  4. Uwe Schwiegelshohn
    Preemptive Weighted Completion Time Scheduling of Parallel Jobs. [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:39-51 [Conf]
  5. Michael Bender, Dror G. Feitelson, Allan Gottlieb, Uwe Schwiegelshohn
    Topic 3: Scheduling and Load Balancing. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2006, pp:155- [Conf]
  6. Franco Gasperoni, Uwe Schwiegelshohn
    List Scheduling in the Presence of Branches: A Theoretical Evaluation. [Citation Graph (0, 0)][DBLP]
    Euro-Par, Vol. II, 1996, pp:515-526 [Conf]
  7. Edwin Naroska, Uwe Schwiegelshohn
    A New Scheduling Method for Parallel Discrete-Event Simulation. [Citation Graph (0, 0)][DBLP]
    Euro-Par, Vol. II, 1996, pp:582-593 [Conf]
  8. Thierry Priol, Craig A. Lee, Uwe Schwiegelshohn, Diego Puppin
    Topic 6: Grid and Cluster Computing. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2004, pp:398- [Conf]
  9. Denis Trystram, Michael Bender, Uwe Schwiegelshohn, Luís Paulo Santos
    Topic 3 Scheduling and Load-Balancing. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2005, pp:207- [Conf]
  10. Uwe Schwiegelshohn, Edwin Naroska
    Verlustleistungsarme Fehlerschutzprotokolle basierend auf punktierten Low Density Parity Check Codes (LDPC). [Citation Graph (0, 0)][DBLP]
    GI Jahrestagung (1), 2005, pp:461- [Conf]
  11. Volker Hamscher, Uwe Schwiegelshohn, Achim Streit, Ramin Yahyapour
    Evaluation of Job-Scheduling Strategies for Grid Computing. [Citation Graph (0, 0)][DBLP]
    GRID, 2000, pp:191-202 [Conf]
  12. Claus Bitten, Jörn Gehring, Uwe Schwiegelshohn, Ramin Yahyapour
    The NRW-Metacomputer-Building Blocks for A Worldwide Computational Grid. [Citation Graph (0, 0)][DBLP]
    Heterogeneous Computing Workshop, 2000, pp:31-40 [Conf]
  13. Uwe Schwiegelshohn, Ramin Yahyapour
    Resource Allocation and Scheduling in Metasystems. [Citation Graph (0, 0)][DBLP]
    HPCN Europe, 1999, pp:851-860 [Conf]
  14. Uwe Schwiegelshohn, Lothar Thiele
    Periodic and Non-periodic Min-Max Equations. [Citation Graph (0, 0)][DBLP]
    ICALP, 1997, pp:379-389 [Conf]
  15. Uwe Schwiegelshohn, Lothar Thiele
    On the Systolic Detection of Shortest Routes. [Citation Graph (0, 0)][DBLP]
    ICPP, 1986, pp:762-764 [Conf]
  16. Steve J. Chapin, Walfredo Cirne, Dror G. Feitelson, James Patton Jones, Scott T. Leutenegger, Uwe Schwiegelshohn, Warren Smith, David Talby
    Benchmarks and Standards for the Evaluation of Parallel Job Schedulers. [Citation Graph (0, 0)][DBLP]
    JSSPP, 1999, pp:67-90 [Conf]
  17. Jochen Krallmann, Uwe Schwiegelshohn, Ramin Yahyapour
    On the Design and Evaluation of Job Scheduling Algorithms. [Citation Graph (0, 0)][DBLP]
    JSSPP, 1999, pp:17-42 [Conf]
  18. Shanq-Jang Ruan, Edwin Naroska, Uwe Schwiegelshohn
    Simultaneous Wire Permutation, Inversion, and Spacing with Genetic Algorithm for Energy-Efficient Bus Design. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2005, pp:- [Conf]
  19. Edwin Naroska, Shanq-Jang Ruan, Feipei Lai, Uwe Schwiegelshohn, Le-Chin Liu
    On optimizing power and crosstalk for bus coupling capacitance using genetic algorithms. [Citation Graph (0, 0)][DBLP]
    ISCAS (5), 2003, pp:277-280 [Conf]
  20. Shanq-Jang Ruan, Edwin Naroska, Uwe Schwiegelshohn
    An efficient algorithm for simultaneous wire permutation, inversion, and spacing. [Citation Graph (0, 0)][DBLP]
    ISCAS (1), 2005, pp:109-112 [Conf]
  21. Uwe Schwiegelshohn, Ramin Yahyapour
    Improving First-Come-First-Serve Job Scheduling by Gang Scheduling. [Citation Graph (0, 0)][DBLP]
    JSSPP, 1998, pp:180-198 [Conf]
  22. Dror G. Feitelson, Larry Rudolph, Uwe Schwiegelshohn
    Parallel Job Scheduling - A Status Report. [Citation Graph (0, 0)][DBLP]
    JSSPP, 2004, pp:1-16 [Conf]
  23. Dror G. Feitelson, Larry Rudolph, Uwe Schwiegelshohn, Kenneth C. Sevcik, Parkson Wong
    Theory and Practice in Parallel Job Scheduling. [Citation Graph (0, 0)][DBLP]
    JSSPP, 1997, pp:1-34 [Conf]
  24. Carsten Franke, Joachim Lepping, Uwe Schwiegelshohn
    On Advantages of Scheduling Using Genetic Fuzzy Systems. [Citation Graph (0, 0)][DBLP]
    JSSPP, 2006, pp:68-93 [Conf]
  25. Franco Gasperoni, Uwe Schwiegelshohn, Kemal Ebcioglu
    On optimal loop parallelization. [Citation Graph (0, 0)][DBLP]
    MICRO, 1989, pp:141-147 [Conf]
  26. Franco Gasperoni, Uwe Schwiegelshohn, John Turek
    Optimal Loop Scheduling on Multiprocessors: A Pumping Lemma for p-Processor Schedules. [Citation Graph (0, 0)][DBLP]
    PaCT, 1995, pp:51-56 [Conf]
  27. Uwe Schwiegelshohn, Ramin Yahyapour
    Analysis of First-Come-First-Serve Parallel Job Scheduling. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:629-638 [Conf]
  28. John Turek, Uwe Schwiegelshohn, Joel L. Wolf, Philip S. Yu
    Scheduling Parallel Tasks to Minimize Average Response Time. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:112-121 [Conf]
  29. Wolfgang Backes, Uwe Schwiegelshohn, Lothar Thiele
    Analysis of Free Schedule in Periodic Graphs. [Citation Graph (0, 0)][DBLP]
    SPAA, 1992, pp:333-342 [Conf]
  30. John Turek, Walter Ludwig, Joel L. Wolf, Lisa Fleischer, Prasoon Tiwari, Jason Glasgow, Uwe Schwiegelshohn, Philip S. Yu
    Scheduling Parallelizable Tasks to Minimize Average Response Time. [Citation Graph (0, 0)][DBLP]
    SPAA, 1994, pp:200-209 [Conf]
  31. Uwe Schwiegelshohn, Ramin Yahyapour
    The NRW Metacomputing Initiative. [Citation Graph (0, 0)][DBLP]
    Wide Area Networks and High Performance Computing, 1998, pp:269-282 [Conf]
  32. Edwin Naroska, Uwe Schwiegelshohn
    On an on-line scheduling problem for parallel jobs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:81, n:6, pp:297-304 [Journal]
  33. Jürgen Götze, Uwe Schwiegelshohn
    VLSI-Suited Orthogonal Solution of Systems of Linear Equations. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1991, v:11, n:4, pp:276-283 [Journal]
  34. Uwe Schwiegelshohn, Franco Gasperoni, Kemal Ebcioglu
    On Optimal Parallelization of Arbitrary Loops. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1991, v:11, n:2, pp:130-134 [Journal]
  35. Uwe Schwiegelshohn, Lothar Thiele
    A Systolic Array for Cyclic-by-Rows Jacobi Algorithms. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1987, v:4, n:3, pp:334-340 [Journal]
  36. Uwe Schwiegelshohn, Lothar Thiele
    Linear Systolic Arrays for Matrix Comutations. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1989, v:7, n:1, pp:28-39 [Journal]
  37. Franco Gasperoni, Uwe Schwiegelshohn
    Generating Close to Optimum Loop Schedules on Parallel Processors. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1994, v:4, n:, pp:391-403 [Journal]
  38. Uwe Schwiegelshohn
    Preemptive Weighted Completion Time Scheduling of Parallel Jobs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:6, pp:1280-1308 [Journal]
  39. Uwe Schwiegelshohn, Walter Ludwig, Joel L. Wolf, John Turek, Philip S. Yu
    Smart SMART Bounds for Weighted Response Time Scheduling. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:1, pp:237-253 [Journal]
  40. Uwe Schwiegelshohn, Lothar Thiele
    A Systolic Array for the Assignment Problem. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1988, v:37, n:11, pp:1422-1425 [Journal]
  41. Franco Gasperoni, Uwe Schwiegelshohn
    List Scheduling in the Presence of Branches: A Theoretical Evaluation. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:196, n:1-2, pp:347-363 [Journal]
  42. Mohamed Eid Hussein, Uwe Schwiegelshohn
    Utilization of nonclairvoyant online schedules. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:362, n:1-3, pp:238-247 [Journal]
  43. Edwin Naroska, Shanq-Jang Ruan, Uwe Schwiegelshohn
    Simultaneously optimizing crosstalk and power for instruction bus coupling capacitance using wire pairing. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. VLSI Syst., 2006, v:14, n:4, pp:421-425 [Journal]
  44. Henri Casanova, Olivier Beaumont, Uwe Schwiegelshohn, Marek Tudruj
    Topic 3 Scheduling and Load-Balancing. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2007, pp:171- [Conf]
  45. Shanq-Jang Ruan, Edwin Naroska, Yen-Jen Chang, Feipei Lai, Uwe Schwiegelshohn
    ENPCO: an entropy-based partition-codec algorithm to reduce power for bipartition-codec architecture in pipelined circuits. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. VLSI Syst., 2002, v:10, n:6, pp:942-949 [Journal]

  46. Topic 3: Scheduling and Load Balancing. [Citation Graph (, )][DBLP]


  47. Genetic Fuzzy Systems applied to Online Job Scheduling. [Citation Graph (, )][DBLP]


  48. Online scheduling in grids. [Citation Graph (, )][DBLP]


  49. New Challenges of Parallel Job Scheduling. [Citation Graph (, )][DBLP]


  50. Development of scheduling strategies with Genetic Fuzzy systems. [Citation Graph (, )][DBLP]


  51. Competitive Coevolutionary Learning of Fuzzy Systems for Job Exchange in Computational Grids. [Citation Graph (, )][DBLP]


  52. Editorial Introduction to the Special Issue: Evolutionary Computing in the Collaborative Research Centre on Computational Intelligence at Technische Universität (TU) Dortmund. [Citation Graph (, )][DBLP]


Search in 0.059secs, Finished in 0.061secs
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