咨询与建议

限定检索结果

文献类型

  • 4 篇 会议
  • 3 篇 期刊文献

馆藏范围

  • 7 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 7 篇 工学
    • 6 篇 软件工程
    • 5 篇 计算机科学与技术...
  • 1 篇 理学
    • 1 篇 数学
  • 1 篇 管理学
    • 1 篇 管理科学与工程(可...

主题

  • 7 篇 divide-and-conqu...
  • 3 篇 algorithms
  • 2 篇 languages
  • 2 篇 program transfor...
  • 2 篇 third list-homom...
  • 2 篇 design
  • 2 篇 shortcut defores...
  • 2 篇 inversion
  • 2 篇 third homomorphi...
  • 1 篇 clique counting
  • 1 篇 equational reaso...
  • 1 篇 parallel composi...
  • 1 篇 balanced tree
  • 1 篇 theory
  • 1 篇 functional progr...
  • 1 篇 fork/join
  • 1 篇 parametric polym...
  • 1 篇 subgraph enumera...

机构

  • 3 篇 tohoku univ send...
  • 2 篇 univ tokyo grad ...
  • 1 篇 univ orleans lif...
  • 1 篇 kochi univ techn...
  • 1 篇 sapienza univ ro...

作者

  • 5 篇 morihata akimasa
  • 3 篇 matsuzaki kimino...
  • 2 篇 morita kazutaka
  • 2 篇 takeichi masato
  • 2 篇 hu zhenjiang
  • 1 篇 garcia renan leo...
  • 1 篇 loulergue freder...
  • 1 篇 coppa emilio
  • 1 篇 finocchi irene
  • 1 篇 benheddi radia

语言

  • 4 篇 英文
  • 2 篇 其他
  • 1 篇 中文
检索条件"主题词=divide-and-conquer parallelism"
7 条 记 录,以下是1-10 订阅
排序:
divide-and-conquer parallel programming with Minimally Synchronous Parallel ML
收藏 引用
7th International Conference on Parallel Processing and Applied Mathematics
作者: Benheddi, Radia Loulergue, Frederic Univ Orleans LIFO F-45067 Orleans France
Minimally Synchronous Parallel ML (MSPML) is a functional parallel programming language. It is based on a small number of primitives on a parallel data structure. MSPML programs are written like usual sequential ML pr... 详细信息
来源: 评论
Automatic inversion generates divide-and-conquer parallel programs  07
Automatic inversion generates divide-and-conquer parallel pr...
收藏 引用
Conference on Programming Language Design and Implementation
作者: Morita, Kazutaka Morihata, Akimasa Matsuzaki, Kiminori Hu, Zhenjiang Takeichi, Masato Univ Tokyo Grad Sch Informat Sci & Technol Tokyo Japan
divide-and-conquer algorithms are suitable for modern parallel machines, tending to have large amounts of inherent parallelism and working well with caches and deep memory hierarchies. Among others, list homomorphisms... 详细信息
来源: 评论
Counting cliques in parallel without a cluster: Engineering a fork/join algorithm for shared-memory platforms
收藏 引用
INFORMATION SCIENCES 2019年 496卷 553-571页
作者: Coppa, Emilio Finocchi, Irene Garcia, Renan Leon Sapienza Univ Rome Comp Sci Dept Rome Italy
In this paper we develop simple and fast multicore parallel algorithms for counting the number of k-cliques in large undirected graphs, for any small constant k >= 4. Clique counting is an important problem in a va... 详细信息
来源: 评论
Automatic inversion generates divide-and-conquer parallel programs
收藏 引用
ACM SIGPLAN NOTICES 2007年 第6期42卷 146-155页
作者: Morita, Kazutaka Morihata, Akimasa Matsuzaki, Kiminori Hu, Zhenjiang Takeichi, Masato Univ Tokyo Grad Sch Informat Sci & Technol Tokyo Japan
divide-and-conquer algorithms are suitable for modern parallel machines, tending to have large amounts of inherent parallelism and working well with caches and deep memory hierarchies. Among others, list homomorphisms... 详细信息
来源: 评论
A Short Cut to Parallelization Theorems  13
A Short Cut to Parallelization Theorems
收藏 引用
18th ACM SIGPLAN International Conference on Functional Programming
作者: Morihata, Akimasa Tohoku Univ Sendai Miyagi 980 Japan
The third list-homomorphism theorem states that if a function is both foldr and foldl, it has a divide-and-conquer parallel implementation as well. In this paper, we develop a theory for obtaining such parallelization... 详细信息
来源: 评论
A Short Cut to Parallelization Theorems
收藏 引用
ACM SIGPLAN NOTICES 2013年 第9期48卷 245-256页
作者: Morihata, Akimasa Tohoku Univ Sendai Miyagi 980 Japan
The third list-homomorphism theorem states that if a function is both foldr and foldl, it has a divide-and-conquer parallel implementation as well. In this paper, we develop a theory for obtaining such parallelization... 详细信息
来源: 评论
Balanced Trees Inhabiting Functional Parallel Programming  11
Balanced Trees Inhabiting Functional Parallel Programming
收藏 引用
16th ACM SIGPLAN International Conference on Functional Programming (ICFP 11)
作者: Morihata, Akimasa Matsuzaki, Kiminori Tohoku Univ Sendai Miyagi 980 Japan Kochi Univ Technol Kochi Japan
divide-and-conquer is an important technique in parallel programming. However, algebraic data structures do not fit divide-and-conquer parallelism. For example, the usual pointer-based implementation of lists cannot e... 详细信息
来源: 评论