Satoshi Fujita

Last Updated :2019/06/03

Affiliations, Positions
Graduate School of Engineering, Professor
E-mail
fujitase.hiroshima-u.ac.jp

Basic Information

Major Professional Backgrounds

  • 1990/01/01, 1995/03/31, Hiroshima University, Research Assistant
  • 1995/01/01, 2007/03/31, Hiroshima University, Associate Professor
  • 2007/04/01, Hiroshima University, Professor

Educational Backgrounds

  • Hiroshima University, Faculty of Engineering, Japan, 1981/04, 1985/03
  • Hiroshima University, Graduate School, Division of Engineering, Japan, 1987/04, 1990/03

Academic Degrees

  • Doctor of Engineering, Hiroshima University
  • Master of Engineering, Hiroshima University

Research Fields

  • Informatics;Computing Technologies;Computer system

Research Keywords

  • Parallel Algorithms
  • Graph Algorithms
  • Communication Algorithms
  • Peer-to-Peer Systems
  • Resource Allocation Problem
  • Scheduling

Educational Activity

Course in Charge

  1. 2019, Undergraduate Education, 3Term, Discrete Mathematics II
  2. 2019, Undergraduate Education, 3Term, Algorithms and Data Structures
  3. 2019, Graduate Education (Master's Program) , First Semester, Seminar in Information Engineering IIA
  4. 2019, Graduate Education (Master's Program) , 3Term, Advanced Parallel Architectures and Algorithms
  5. 2019, Graduate Education (Master's Program) , First Semester, Directed Study in Information Engineering IA
  6. 2019, Graduate Education (Master's Program) , Second Semester, Directed Study in Information Engineering IB
  7. 2019, Graduate Education (Master's Program) , First Semester, Directed Study in Information Engineering IIA
  8. 2019, Graduate Education (Master's Program) , Second Semester, Directed Study in Information Engineering IIB
  9. 2019, Graduate Education (Master's Program) , First Semester, Seminar in Information Engineering IA
  10. 2019, Graduate Education (Master's Program) , Second Semester, Seminar in Information Engineering IB
  11. 2019, Graduate Education (Master's Program) , Second Semester, Seminar in Information Engineering IIB

Research Activities

Academic Papers

  1. Optimal serial broadcast of successive chunks, THEORETICAL COMPUTER SCIENCE, 575, 3-9, 20150401
  2. Approximation scheme for burst scheduling with minimum overhead in time slicing mobile TV, JOURNAL OF SUPERCOMPUTING, 69(2), 561-575, 20140801
  3. Hierarchical Architecture for Peer-to-Peer Video on Demand Systems with the Notion of Dynamic Swarms, IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E97D(12), 3025-3032, 20141201
  4. Tree-Based Consistency Maintenance Scheme for Peer-to-Peer File Sharing of Editable Contents, IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E97D(12), 3033-3040, 20141201
  5. Worst Case Analysis of Approximation Algorithm of Abrams et al. for the Set k-Cover Problem, IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E97D(3), 399-405, 20140301
  6. A Cooperative Peer Clustering Scheme for Unstructured Peer-to-Peer Systems, International Journal of Peer to Peer Networks, 4(2)
  7. A Cost-Effective Buffer Map Notification Scheme for P2P VoDs Supporting VCR Operations, IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E96D(12), 2713-2719, 2013
  8. Reputation-Based Colluder Detection Schemes for Peer-to-Peer Content Delivery Networks, IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E96D(12), 2696-2703, 2013
  9. Automatic Tag Attachment Scheme based on Text Clustering for Efficient File Search in Unstructured Peer-to-Peer File Sharing Systems, JOURNAL OF UNIVERSAL COMPUTER SCIENCE, 18(8), 1032-1047, 2012
  10. A Branch-and-Bound Algorithm for Solving the Multiprocessor Scheduling Problem with Improved Lower Bounding Techniques, IEEE TRANSACTIONS ON COMPUTERS, 60(7), 1006-1016, 20110701
  11. A Memory Efficient Result Cache Scheme for P2P DHT Based on Bloom Filters, IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E94D(8), 1602-1609, 20110801
  12. Adaptive Prefetching Scheme for Peer-to-Peer Video-on-Demand Systems with a Media Server, IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E94D(12), 2362-2369, 20111201
  13. A tight bound on the number of mobile servers to guarantee transferability among dominating configurations, DISCRETE APPLIED MATHEMATICS, 158(8), 913-920, 20100428
  14. Polynomial Time Algorithm for Constructing Vertex-Disjoint Paths in Transposition Graphs, NETWORKS, 56(2), 149-157, 20100901
  15. Semi-Dynamic Multiprocessor Scheduling with an Asymptotically Optimal Performance Ratio, IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E92A(8), 1764-1770, 20090801
  16. A new caching technique to support conjunctive queries in P2P DHT, IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E91D(4), 1023-1031, 20080401
  17. An efficient scheduling scheme for assigning transmission opportunity in QoS-guaranteed wireless LAN, IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E91A(7), 1562-1569, 20080701
  18. Extended Skip Graphs for Efficient Key Search in Peer-to-Peer Environment, Journal of Interconnection Networks, 8(2), 119-132, 20070601
  19. A fault-tolerant content addressable network, IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E89D(6), 1923-1930, 20060601
  20. A generic solver based on functional parallelism for solving combinatorial optimization problems, IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E89D(6), 1940-1947, 20060601
  21. A localization scheme for sensor networks based on wireless communication with anchor groups, IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E89D(5), 1614-1621, 20060501
  22. Proxy-based index caching for content-addressable networks, IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E89D(2), 555-562, 20060201
  23. A tight bound on the number of mobile servers to guarantee the mutual transferability among dominating configurations, ALGORITHMS AND COMPUTATION, 3827, 563-572, 20051201
  24. CHQ: A multi-agent reinforcement learning scheme for partially observable Markov decision processes, IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E88D(5), 1004-1011, 20050501
  25. Distributed Zone Partitioning Schemes for CAN and its Application to the Load Balancing in Pure P2P Systems, Trans. IPS Japan, 46(2), 348-356, 20050201
  26. On heuristics for solving winner determination problem in combinatorial auctions, JOURNAL OF HEURISTICS, 10(5), 507-523, 20040901
  27. Three-round adaptive diagnosis in binary n-cubes, ALGORITHMS AND COMPUTATION, 3341, 442-451, 20041201
  28. Time-efficient multicast to local vertices in star interconnection networks under the single-port model, IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E87D(2), 315-321, 20040201
  29. A greedy multicast algorithm in k-ary n-cubes and its worst case analysis, IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E86D(2), 238-245, 20030201
  30. On-line grid-packing with a single active grid, INFORMATION PROCESSING LETTERS, 85(4), 199-204, 20030228
  31. Optimal Neighborhood Broadcast in Star Graphs, Journal of Interconnection Networks (JOIN), 4(4), 419-428, 20031201
  32. Sparse Hypercube - a minimal k-line broadcast graph, DISCRETE APPLIED MATHEMATICS, 127(3), 431-446, 20030501
  33. An Active Scheduler: Autonomous Concurrency Control of Parallel Programs in Distributed Environment, IEICE Trans. on Information and Systems, 85-D(11), 1851-1858, 20020401
  34. Two-Dimensional On-Line Bin Packing Problem with Rotatable Items, Theoretical Computer Science, 289(2), 939-952, 20020401
  35. A study on r-configurations - A resource assignment problem on graphs, SIAM JOURNAL ON DISCRETE MATHEMATICS, 13(2), 227-254, 20000407
  36. Approximation algorithms for multiprocessor scheduling problem, IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E83D(3), 503-509, 20000301
  37. Neighbourhood Information Dissemination in the Star Graph, IEEE Transactions on Computers, 49(12), 1366-1370, 20001201
  38. A Fault Tolerant Broadcast Scheme in Star Graphs Under the Single-Port Communication Model, IEEE Transactions on Computers, 48(10), 1123-1126, 19991001
  39. A Quorum Based k-Mutual Exclusion by Weighted k-Quorum Systems, Information Processing Letters, 67(4), 191-197, 19980401
  40. Neighbourhood Gossiping in Hypercubes, Parallel Processing Letters, 8(2), 189-195, 19980401
  41. Minimum-Cost Line Broadcast in Paths, Discrete Applied Mathematics, 75, 255-268, 19970401
  42. A Nonoblivious Bus Access Scheme Yields an Optimal Partial Sorting Algorithm, Journal of Parallel and Distributed Computing, 34(1), 111-116, 19960401
  43. Fast Gossiping on Mesh-Bus Computers, IEEE Transactions on Computers, 45(11), 1326-1330, 19961101
  44. Optimal Group Gossiping in Hypercubes Under a Circuit-Switching Model, SIAM Journal on Computing, 25(5), 1045-1060, 19961001
  45. A Note on the Size of a Multicast Tree in Hypercubes, Information Processing Letters, 54(4), 223-227, 19950401
  46. A Distributed k-Mutual Exclusion Algorithm using k-Coterie, Information Processing Letters, 49, 213-218, 19940401
  47. Availability of k-coterie, IEEE Trans. Computer, 42(5), 553-558, 19930501
  48. Fast Gossiping on Square Mesh Computers, Information Processing Letters, 48, 127-130, 19930401
  49. Optimal Gossiping in Mesh-Bus Computers, Parallel Processing Letters, 3(4), 357-361, 19930401
  50. Broadcasting a Stream of Chunks in Heterogeneous Networks with a Short Maximum Broadcast Time, JOURNAL OF INTERCONNECTION NETWORKS, 18(2-3), 2018

Awards

  1. 2011年07月, Best Short Paper Award of the International Conference on Advances in Social Network Analysis and Mining, Automatic Tag Attachment Scheme for Efficient File Search in Peer-To-Peer File Sharing Systems
  2. 2012年12月, Outstanding Paper Award of the Thirteenth International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2012), An Approximation Scheme for Burst Scheduling in Time Slicing Mobile TVs
  3. 2014年06月04日, Fellow of IPSJ, 一般社団法人情報処理学会